An NP-complete fragment of LTL

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

Volumn 3340, Issue , 2004, Pages 334-344

  Muscholl, Anca ^a   Walukiewicz, Igor ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC;

LINEAR TIME TEMPORAL LOGIC; NP COMPLETE; SATISFIABILITY PROBLEMS;

TEMPORAL LOGIC;

EID: 33751426069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_28     Document Type: Article

References (13)

1. J. Cohen, D. Perrin, and J.-E. Pin. On the expressive power of temporal logic. Journal of Computer and System Sciences, 46(3):271-294, 1993.
2. S. Demri and Ph. Schnoebelen. The complexity of prepositional linear temporal logics in simple cases. Information and Computation, 174(1):84-103, 2002.
3. C. Dixon, M. Fisher, and M. Reynolds. Execution and proof in a horn-clause temporal logic. In H. Barringer, M. Fisher, D. Gabbay, and G. Gough, editors, Advances in Temporal Logic, volume 16 of Applied Logic Series, pages 413-433. Kluwer Academic, 2000.
4. E. A. Emerson and C. Lei. Modalities for model-checking: Branching-time logic strikes back. Science of Computer Programming, 8(3):275-306, 1987.
5. K. Etessami, M. Vardi, and Th. Wilke. First-order logic with two variables and unary temporal logic. In LICS'97 - 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, pages 228-235, 1997.
6. J. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.
7. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In POPL'85 - 12th Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, pages 97-107, 1985.
8. N. Markey. Past is for free: On the complexity of verifying linear temporal properties with past. Acta Informatica, 40(6-7):431-458, 2004.
9. N. Markey and Ph. Schnoebelen. Model checking a path. In CONCUR'03 - Concurrency Theory, 14th International Conference, Marseille, France, number 2761 in Lecture Notes in Computer Science, pages 248-262. Springer, 2003.
10. Ph. Schnoebelen. The complexity of temporal logic model checking. Advances in Modal Logic, 4:437-459, 2003.
11. A. P. Sistla and E. M. Clarke. The complexity of prepositional linear temporal logic. Journal of the ACM, 32(3):733-749, 1985.
12. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In ICALP'98 - Automata, Languages and Programming, 25th International Colloquium, Aalborg (Denmark), number 1443 in Lecture Notes in Computer Science, pages 140-151, 1998.
13. Th. Wilke. Classifying discrete temporal properties. In STAGS'99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier (Germany), number 1563 in Lecture Notes in Computer Science, pages 32-46, 1999.