The Complexity of Propositional Linear Temporal Logics in Simple Cases

@article{Demri2002TheCO,
  title={The Complexity of Propositional Linear Temporal Logics in Simple Cases},
  author={St{\'e}phane Demri and Philippe Schnoebelen},
  journal={Inf. Comput.},
  year={2002},
  volume={174},
  pages={84-103}
}
It is well-known that model checking and satisfiability for P LTL arePSPACE-complete. By contrast, very little is known about whether there exist s ome 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 ch ecking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temp oral connectives allowed, (2) the… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
62 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 62 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

A perspective on certain polynomial time solvable classes of Satisfiability

  • A. Van Gelder.
  • 2002

Execution and proof in a Hornclause temporal logic

  • H. Barringer, M. Fisher, D. Gabbay
  • 2000

The complexity of concept languages

  • S. Demri, Ph.
  • Information and Computation
  • 1997

The model checker Spin

  • J. Y. Halpern, J. H. Reif
  • IEEE Transactions on Software Engineering
  • 1997

Similar Papers

Loading similar papers…