Finite automata on timed ω-trees

Theoretical Computer Science

Volumn 293, Issue 3, 2003, Pages 479-505

  La Torre, Salvatore ^a,b   Napoli, Margherita ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; REAL TIME SYSTEMS; TREES (MATHEMATICS);

DECISION PROBLEMS;

FINITE AUTOMATA;

EID: 0037427175     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00611-4     Document Type: Conference Paper

References (28)

1. Alur R., Courcoubetis C., Dill D.L. Model-checking in dense real-time. Inform. Comput. 104(1):1993;2-34.
2. Alur R., Dill D.L. A theory of timed automata. Theoret. Comput. Sci. 126:1994;183-235.
3. Asarin E., Maler O. As soon as possible. time optimal control for timed automata Proc. 2nd Internat. Workshop on Hybrid Systems. Computation and Control, Lecture Notes in Computer Science vol. 1569:1999;19-30 Springer, Berlin.
4. Asarin E., Maler O., Pnueli A., Sifakis J. Controller synthesis for timed automata. IFAC Symp. System Structure and Control. 1998;469-474 Elsevier, Amsterdam.
5. Bernholtz O., Vardi M.Y., Wolper P. An automata-theoretic approach to branching-time model checking. Proc. 6th Internat. Conf. on Computer Aided Verification, Lecture Notes in Computer Science. vol. 818:1994;142-155 Springer, Berlin.
6. J.R. Büchi, On a decision method in restricted second-order arithmetic, in: Proc. Internat. Congress Logic, Methodology, and Philosophy of Science, vol. 1960, Stanford University Press, 1962, pp. 1-12.
7. Büchi J.R., Landweber L.H. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138:1969;295-311.
8. Emerson E.A. Temporal and modal logic. van Leeuwen J. Handbook of Theoretical Computer Science. vol. B:1990;995-1072 Elsevier, Amsterdam.
9. M. Faella, S. La Torre, A. Murano, Automata-theoretic decision of timed games, in: Proc. 3rd Internat. Workshop on Verification, Model Checking, and Abstract Interpretation, VMCAI 2002, 2002, to appear.
10. Henzinger T.A., Horowitz B., Majumdar R. Rectangular hybrid games. Proc. 10th Internat. Conf. on Concurrency Theory, CONCUR'99, Lecture Notes in Computer Science. vol. 1664:1999;320-335 Springer, Berlin.
11. Henzinger T., Kopke P. Discrete-time control for rectangular hybrid automata. Theoret. Comput. Sci. 221(1-2):1999;369-392.
12. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
13. S. La Torre, Advances in finite automata and temporal logic for system verification, Doctorate Thesis, Università degli Studi di Napoli "Federico II", Napoli, Italy, 1999.
14. S. La Torre, Verification of reactive systems and decision problems in temporal logic, Ph.D. Thesis, University of Pennsylvania, Philadelphia, USA, 2001.
15. La Torre S., Napoli M. A decidable dense branching-time temporal logic. Proc. 20th Conf. on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS'00, Lecture Notes in Computer Science. vol. 1974:2000;139-150 Springer, Berlin.
16. La Torre S., Napoli M. Timed tree automata with an application to temporal logic. Acta Inform. 38(2):2001;89-116.
17. McNaughton R. Testing and generating infinite sequences by a finite automaton. Inform. Control. 9:1966;521-530.
18. McNaughton R. Infinite games played on finite graphs. Ann. Pure Appl. Logic. 65:1993;149-184.
19. Owicki S., Lamport L. Proving liveness properties of concurrent programs. ACM Trans. Programming Languages Systems. 4(3):1982;455-595.
20. A. Pnueli, The temporal logic of programs, in: Proc. 18th IEEE Symp. on Foundations of Computer Science, 1977, pp. 46-77.
21. A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. 16th ACM Symp. on Principles of Programming Languages, 1989, pp. 179-190.
22. Rabin M.O. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141:1969;1-35.
23. M.O. Rabin, Weakly definable relations and special automata, Math. Logic Foundations Set Theory (1970).
24. M.O. Rabin, Automata on infinite objects and Church's problem, Trans. Amer. Math. Soc. (1972).
25. Thomas W. Automata on infinite objects. van Leeuwen J. Handbook of Theoretical Computer Science. vol. B:1990;133-191 Elsevier, Amsterdam.
26. Thomas W. On the synthesis of strategies in infinite games. Mayr E.W., Puech C. 12th Ann. Symp. on Theoretical Aspects of Computer Science, STACS'95, Lecture Notes in Computer Science. vol. 900:1995;1-13 Springer, Berlin.
27. Vardi M.Y. Nontraditional applications of automata theory. Proc. Internat. Symp. TACS'94, Lecture Notes in Computer Science. vol. 789:1994;575-597 Springer, Berlin.
28. Vardi M.Y., Wolper P. Automata-theoretic techniques for modal logics of programs. J. Comput. System Sci. 32:1986;182-211.