The complexity of propositional linear temporal logics in simple cases [chapter]

S. Demri, Ph. Schnoebelen
1998 Lecture Notes in Computer Science  
It is well-known that model checking and satisfiability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model checkers are successfully used in practice. In this paper we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the
more » ... er of atomic propositions, and (3) the temporal height.
doi:10.1007/bfb0028549 fatcat:tv676j3etfdkva4dxkruur3axe