19 search results - page 2 / 4 » Net Reductions for LTL Model-Checking |
APN
2001
Springer
13 years 10 months ago
2001
Springer
FSTTCS
2006
Springer
13 years 9 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...
CAV
2005
Springer
13 years 11 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
CONCUR
2000
Springer
13 years 9 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...