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...
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...
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...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
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...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
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...