The complexity of propositional linear temporal logics in simple cases (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 61-72

  Demri, S ^a   Schnoebelen, Ph ^b  

^a UNIV GRENOBLE ALPES   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC PROPOSITIONS; EXTENDED ABSTRACTS; LINEAR TEMPORAL LOGIC; SATISFIABILITY; WORST-CASE COMPLEXITY;

COMPUTER SCIENCE;

MODEL CHECKING;

EID: 78649831891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028549     Document Type: Conference Paper

References (16)

1. C.-C. Chen and I.-P. Lin. The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Information Processing Letters, 45(3):131-136, March 1993.
2. C. Dixon, M. Fisher, and M. Reynolds. Execution and proof in a Horn-clause temporal logic. In Proc. 2nd Int. Conf. on Temporal Logic (ICTL'97), Manchester, UK, July 1997, 1997. to appear.
3. S. Demri and Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. Research Report LSV-97-11, Lab. Specification and Verification, ENS de Cachan, Cachan, France, December 1997. Available at http://www.lsv.ens-cachan.fr/~phs.
4. E. A. Emerson, M. Evangelist, and J. Srinivasan. On the limits of efficient temporal decidability. In Proc. 5th IEEE Symp. Logic in Computer Science (LICS'90), Philadelphia, PA, USA, June 1990, pages 464-475, 1990.
5. E. A. Emerson and C. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8:275-306, 1987.
6. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 16, pages 995-1072. Elsevier Science Publishers, 1990.
7. J. Y. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75(2):361-372, 1995.
8. D. Harel. Recurring dominos: Making the highly undecidable highly understandable. Annals of Discrete Mathematics, 24:51-72, 1985.
9. J. Y. Halpern and J. H. Reif. The propositional dynamic logic of deterministic, well-structured programs. Theor. Comp. Sci., 27(1-2):127-165, 1983.
10. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. A, chapter 2, pages 67-161. Elsevier Science Publishers, 1990.
11. L. Lamport. What good is temporal logic ? In R. E. A. Mason, editor, Information Processing'83. Proc. IFIP 9th World Computer Congress, Sep. 1983, Paris, France, pages 657-668. North-Holland, 1983.
12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
13. A. Nakamura and H. Ono. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica, 39(4):325-333, 1980.
14. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, July 1985.
15. E. Spaan. Complexity of Modal Logics, PhD thesis, ILLC, Amsterdam University, NL, March 1993.
16. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths (extended abstract). In Proc. 24th IEEE Symp. Found. of Computer Science (FOCS'83), Tucson, USA, Nov. 1983, pages 185-194, 1983.