The Complexity of Propositional Linear Temporal Logics in Simple Cases

Stéphane Demri (1, 2) , Philippe Schnoebelen (3, 1)

1 CNRS - Centre National de la Recherche Scientifique
2 LSV - Laboratoire Spécification et Vérification [Cachan]
3 LSV - Laboratoire Spécification et Vérification

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.

Mots clés: linear-time temporal logic LTL; complexity; verification; temporal logic; model-checking; temporal depth; fragment

Domaines: Informatique [cs]; Logique en informatique [cs.LO]

Stéphane Demri, Philippe Schnoebelen. The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation, 2002, 174 (1), pp.84-103. ⟨10.1006/inco.2001.3094⟩. ⟨hal-03189492⟩