LTL with past and two-way very-weak alternating automata

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

Volumn 2747, Issue , 2003, Pages 439-448

  Gastin, Paul ^a   Oddoux, Denis ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ALTERNATING AUTOMATA; TRANSLATION PROCEDURES; TWO WAYS;

AUTOMATA THEORY;

EID: 33645593784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_38     Document Type: Article

References (18)

1. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995-1072. Elsevier Science, 1990.
2. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. of PoPL'80, pages 163-173, Las Vegas, Nev., 1980.
3. P. Gastin and D. Oddoux. Fast ltl to büchi automata translation. In Proc. of CAV'01, number 2102 in LNCS, pages 53-65. Springer Verlag, 2001.
4. P. Gastin and D. Oddoux. LTL with past and two-way very-weak alternating automata. Tech. Rep. LIAFA 2003-010, Université Paris 7 (France).
5. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
6. J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California, 1968.
7. Y. Kesten, Z. Manna, H. McGuire, and A. Pnueli. A decision algorithm for full prepositional temporal logic. In Proc. of CAV'93, number 697 in LNCS, pages 97-109. Springer Verlag, 1993.
8. O. Kupferman, N. Piterman, and M.Y. Vardi. Extended temporal logic revisited. In Proc. of CONCUR'01, number 2154 in LNCS, pages 519-535. Springer Verlag, 2001.
9. F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal logic with forgettable past. In Proc. of LICS'02, pages 383-392, 2002.
10. F. Laroussinie and Ph. Schnoebelen. A hierarchy of temporal logics with past. Theoretical Computer Science, 148:303-324, 1995.
11. O. Lichtenstein, A. Pnueli, and L.D. Zuck. The glory of the past. In Proc. of the 3rd Workshop on Logics of Programs, number 193 in LNCS, pages 196-218. Springer Verlag, 1985.
12. Z. Manna and A. Pnueli. The temporal logic of reactive and concurent systems: Specification. Springer Verlag, Berlin-Heidelberg-New York, 1992.
13. A. Pnueli. The temporal logic of programs. In Proc. of FOCS'77, pages 46-57, 1977.
14. Y.S. Ramakrishna, L.E. Moser, L.K. Dillon, P.M. Melliar-Smith, and G. Kutty. An automata theoretic decision procedure for propositional temporal logic with Since and Until. Fundamenta Informaticae, 17:271-282, 1992.
15. A.P. Sistla and E.M. Clarke. The complexity of propositional linear time logic. Journal of the Association of Computing Machinery, 32:733-749, 1985.
16. M.Y. Vardi. Reasonning about the past with two-way automata. In Proc. of ICALP'98, number 1443 in LNCS, pages 628-641. Springer Verlag, 1998.
17. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. of LICS'86, pages 332-344, 1986.
18. M.Y. Vardi and P. Wolper. Reasonning about infinite computations. Information and Computation, 115:1-37, 1994.