The complexity of propositional linear temporal logics in simple cases - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

The complexity of propositional linear temporal logics in simple cases

Résumé

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.
Fichier principal
Vignette du fichier
main.pdf (387.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03199998 , version 1 (20-04-2021)

Identifiants

Citer

Stéphane Demri, Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Jan 1998, Paris, France. pp.61-72, ⟨10.1007/BFb0028549⟩. ⟨hal-03199998⟩
49 Consultations
110 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More