Reasoning about transfinite sequences

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

Volumn 3707 LNCS, Issue , 2005, Pages 248-262

  Demri, Stéphane ^a   Nowak, David ^b  

^a CNRS   (France)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTROL EQUIPMENT; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

REASONING; SATISFIABILITY PROBLEM; TEMPORAL LOGIC; TRANSFINITE SEQUENCES;

FORMAL LOGIC;

EID: 33646189240     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562948_20     Document Type: Conference Paper

References (29)

1. R. Alur, T. Feder, and T. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43:116-146, 1996.
2. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial observation. TCS, 303(1):7-34, 2003.
3. E. Asarin, O. Maler, and A. Pnueli. Symbolic controller synthesis for discrete and timed systems. In Hybrid systems II, volume 999 of LNCS, pages 1-20. Springer, 1995.
4. N. Bedon. Langages reconnaissables de mots indexés par des ordinaux. PhD thesis, Université Marne-la-vallée, 1998.
5. D. Bérard and C. Picaroriny. Accepting Zeno words: a way toward timed refinements. In MFCS'97, volume 1295 of LNCS, pages 149-158. Springer, 1997.
6. A. Bès. Decidability and definability results related to the elementary theory of ordinal multiplication. Fundamenta Mathematicae, 171:197-211, 2002.
7. P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In CAV'03, volume 2725 of LNCS, pages 180-192. Springer, 2003.
8. V. Bruyère and O. Carton. Automata on linear orderings. In MFCS 2001, volume 2136 of LNCS, pages 236-247. Springer-Verlag, 2001.
9. J. Büchi. Transfinite automata recursions and weak second order theory of ordinals. In Int. Cong. Logic, Methodology and Philosophy of Science, Jerusalem, pages 3-23, 1964.
10. J. Büchi and D. Siefkes. The monadic second order theory of all countable ordinals, volume 328 of Lecture Notes in Mathematics. Springer, 1973.
11. O. Carton. Accessibility in automata on scattered linear orderings. In MFCS 2002, volume 2420 of LNCS, pages 155-164. Springer, 2002.
12. C. Choffrut. Elementary theory of ordinals with addition and left translation by ω. In DLT'01, volume 2295 of LNCS, pages 15-20. Springer, 2002.
13. n-tapes. JCSS, 17:81-97, 1978.
14. P. Cuijpers, M. Reniers, and A. Engels. Beyond Zeno-behaviour. Technical report, TU of Eindhoven, 2001.
15. S. Demri and D. Nowak. Reasoning about transfinite sequences. arXiv:cs.LO/0505073, May 2005.
16. M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. JCSS, 18:194-211, 1979.
17. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In POPL'80. ACM Press, 1980.
18. P. Godefroid and P. Wolper. A partial approach to model checking. I&C, 110(2):305-326, 1994.
19. J. Hemmer and P. Wolper. Ordinal finite automata and languages (extended abstract). Technical report, Université of Liège, 1991.
20. Y. Hirshfeld and A. Rabinovich. Logics for real time: decidability and complexity. Fundamenta Informaticae, 62:1-28, 2004.
21. J. Kamp. Tense Logic and the theory of linear order. PhD thesis, UCLA, USA, 1968.
22. C. Lutz, D. Walther, and F. Wolter. Quantitative temporal logics: PSPACE and below. In TIME'05, 2005. To appear.
23. F. Maurin. The theory of integer multiplication with order restricted to primes is decidable. The Journal of Symbolic Logic, 62(1):123-130, 1997.
24. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In 16th ACM POPL, Austin, Texas, pages 179-190, 1989.
25. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77:81-98, 1989.
26. M. Reynolds. The complexity of the temporal logic with until over general linear time. JCSS, 66(2):393-426, 2003.
27. S. Rohde. Alternating Automata and The Temporal Logic of Ordinals. PhD thesis, University of Illinois, 1997.
28. M. Vardi and P. Wolper. Reasoning about infinite computations. I&C, 115:1-37, 1994.
29. J. Wojciechowski. Classes of transfinite sequences accepted by nondeterministic finite automata. Annales Societatid Mathematicae Polonae, pages 191-223, 1984.