309 search results - page 19 / 62 » Model Checking Games for Branching Time Logics |
105
click to vote
CONCUR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
151
click to vote
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
108
click to vote
CONCUR
2006
Springer
14 years 11 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
TAPSOFT
1997
Springer
15 years 1 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
CAV
2003
Springer
15 years 2 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...