49 search results - page 4 / 10 » Symbolic Model Checking of Finite Precision Timed Automata |
ISSTA
1998
ACM
13 years 10 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...
TACAS
2005
Springer
14 years 15 days ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
CONCUR
2000
Springer
13 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
IJCAI
2003
13 years 8 months ago
2003
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
FMSD
2008
13 years 7 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...