2920 search results - page 137 / 584 » Finite information logic |
87
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
104
click to vote
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
96
Voted
MST
2008
15 years 22 days ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
96
Voted
JACM
2002
15 years 14 days ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
LICS
2003
IEEE
15 years 6 months ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...