9 search results - page 2 / 2 » An Alternative Construction in Symbolic Reachability Analysi... |
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
FORMATS
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
CAV
1999
Springer
13 years 9 months ago
1999
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. A computation that violates a general linea...