321 search results - page 19 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ISSTA
1998
ACM
14 years 10 days ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
DC
1998
13 years 8 months ago
1998
CAV
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal µ-calculus capable of defining non-regular properties. Some empiri...
FORMATS
2005
Springer
14 years 2 months ago
2005
Springer
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...