231 search results - page 10 / 47 » Mu-calculus path checking |
CAV
1998
Springer
13 years 11 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
CORR
2008
Springer
13 years 7 months 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...
RV
2007
Springer
14 years 1 months ago
2007
Springer
Probabilistic correctness is another important aspect of reliable systems. A soft real-time system, for instance, exhibits probabilistic behaviors from tolerating some degrees of ...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...