The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
Preprint
Abstract
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 set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper systematically studies the model-checking problem for LTL formulae over restricted sets of propositional and temporal operators. For almost all combinations of temporal and propositional operators, we determine whether the model-checking problem is tractable (in P) or intractable (NP-hard). We then focus on the tractable cases, showing that they all are NL-complete or even logspace solvable. This leads to a surprising gap in complexity between tractable and intractable cases. It is worth noting that our analysis covers an infinite set of problems, since there are infinitely many sets of propositional operators.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- The Complexity of Problems Defined by Boolean Circuits2005
- Past is for free: on the complexity of verifying linear temporal properties with pastActa Informatica, 2004
- Optimal satisfiability for propositional calculi and constraint satisfaction problemsInformation and Computation, 2003
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Satisfiability problems for propositional calculiTheory of Computing Systems, 1979
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- Maze recognizing automata and nondeterministic tape complexityJournal of Computer and System Sciences, 1973
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)1942