The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments

@article{Bauland2009TheTO,
  title={The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments},
  author={Michael Bauland and Martin Mundhenk and Thomas Schneider and Henning Schnoor and Ilka Schnoor and Heribert Vollmer},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2009},
  volume={231},
  pages={277-292}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS