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...
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...
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
In this paper, we extend Moss and Parikh’s approach to reasoning about topological properties of knowledge. We turn that system in a spatio-temporal direction by successively ad...
Interactions between agents in an open system such as the Internet require a significant degree of flexibility. A crucial aspect of the development of such methods is the notion o...