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 number of atomic propositions, and (3) the temporal height.
Other fragments of ltl (with no past) are addressed in REF , namely fragments obtained by bounding the temporal height and the number of atomic propositions of formulas.
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Mathematics Computer Science