138 search results - page 6 / 28 » Linear Encodings of Bounded LTL Model Checking |
APN
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
104
click to vote
ASIAN
2003
Springer
15 years 3 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
CHARME
2001
Springer
15 years 2 months ago
2001
Springer
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
TOCL
2011
14 years 4 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...