The complexity of propositional linear temporal logics in simple cases

(Extended abstract)
  • S. Demri
  • Ph. Schnoebelen
Logic I

DOI: 10.1007/BFb0028549

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)
Cite this paper as:
Demri S., Schnoebelen P. (1998) The complexity of propositional linear temporal logics in simple cases. In: Morvan M., Meinel C., Krob D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg

Abstract

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 one obtains when restrictions are put on (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • S. Demri
    • 1
  • Ph. Schnoebelen
    • 2
  1. 1.Leibniz-IMAGUniv. Grenoble & CNRS UMR 5522Grenoble CedexFrance
  2. 2.Lab. Specification and VerificationENS de Cachait & CNRS URA 2236Cachan CedexFrance

Personalised recommendations