493 search results - page 9 / 99 » Bounded LTL Model Checking with Stable Models |
179
click to vote
CSFW
2007
IEEE
16 years 4 days ago
2007
IEEE
Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their applicability...
165
Voted
SPIN
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...
167
Voted
CORR
2008
Springer
15 years 5 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...
165
Voted
TOCL
2011
15 years 22 days 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...
142
Voted
APN
2004
Springer
15 years 11 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...