505 search results - page 7 / 101 » Global Model Checking of Ordered Multi-Pushdown Systems |
IJCSA
2007
13 years 7 months ago
2007
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
ENTCS
2006
13 years 7 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
ISSTA
1998
ACM
13 years 11 months 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...
FMCO
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...