Automata-theoretic decision of timed games

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

Volumn 2294 LNCS, Issue , 2002, Pages 94-108

  Faella, Marco ^a   La Torre, Salvatore ^a,b   Murano, Aniello ^a,c  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; FORESTRY;

AUTOMATA-THEORETIC APPROACH; DECISION PROBLEMS; EXPONENTIAL TIME; LOWER BOUNDS; LTL GAMES; PROGRAM SYNTHESIS; TIMED AUTOMATA; TREE AUTOMATA;

MODEL CHECKING;

EID: 84894618648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47813-2_7     Document Type: Conference Paper

References (30)

1. R. Alur, L. de Alfaro, T. Henzinger, and F. Mang. Automating modular verification. In CONCUR'99: Concurrency Theory, Tenth Int. Conference, LNCS 1664, pages 82-97, 1999.
2. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. of the 38th IEEE Symposium on Foundations of Computer Science, pages 100 - 109, 1997.
5. R. Alur, T. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran. MOCHA: Modularity in model checking. In Proc. of the Tenth Int. Conference on Computer Aided Verification, LNCS 1427, pages 521 - 525. Springer-Verlag, 1998.
6. R. Alur and S. La Torre. Deterministic generators and games for ltl fragments. In Proc. of the 16th IEEE Symposium on Logic in Computer Science, LICS'01, pages 291-300, 2001.
7. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. In Proc. of the 16th Intern. Colloquium on Automata, Languages and Programming, ICALP'89, LNCS 372, pages 1-17, 1989.
8. E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In Proc. of the 2nd International Workshop on Hybrid Systems: Computation and Control, LNCS 1569, pages 19 - 30. Springer-Verlag, 1999.
9. E. Asarin, O. Maler, A. Pnueli, and J. Sifakis. Controller synthesis for timed automata. In Proc. IFAC Symposium on System Structure and Control, pages 469 - 474. Elsevier, 1998.
10. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state stategies. Trans. Amer. Math. Soc., 138:295-311, 1969.
11. A. Church. Logic, arithmetic, and automata. In Proc. of the International Congress of Mathematics, pages 23-35, 1962.
12. E.A. Emerson and E.M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
13. E.A. Emerson and C.S. Jutla. The complexity of tree automata and logics of programs. In Proc. of the 29th IEEE-CS Symposium on Foundations of Computer Science, pages 328 - 337, 1988.
14. T.A. Henzinger, B. Horowitz, and R. Majumdar. Rectangular hybrid games. In Proc. of the 10th International Conference on Concurrency Theory, CONCUR' 99, LNCS 1664, pages 320 - 335, 1999.
15. O. Kupferman and M.Y. Vardi. Module checking. In Computer Aided Verification, Proc. Eighth Int. Workshop, LNCS 1102, pages 75 - 86. Springer-Verlag, 1996.
16. O. Kupferman and M.Y. Vardi. Module checking revisited. In Proc. of the 9th Intern. Conference on Computer Aided Verification, CAV'97, LNCS 1254, pages 36 -47, June 1997.
17. O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. of the 13th IEEE Symposium on Logic in Computer Science, pages 81 - 92, June 1998.
18. S. La Torre and M. Napoli. Finite Automata on Timed ω-Trees. To appear in Theoretical Computer Science.
19. O. Lichtenstein and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specification. In Proc. of the 12th ACM Symposium on Principles of Programming Languages, pages 97 - 107, 1985.
20. J. Von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
21. A. Pnueli. The temporal logic of programs. In Proc. of the 18th IEEE Symposium on Foundations of Computer Science, pages 46 - 77, 1977.
22. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. of the 16th ACM Symposium on Principles of Programming Languages, pages 179 - 190, 1989.
23. M.O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1-35, 1969.
24. M.O. Rabin. Automata on infinite objects and Church's problem. Trans. Amer. Math. Soc., 1972.
25. S. Safra. On the complexity of ω-automata. In Proc. of the 29th IEEE Symposium on Foundations of Computer Science, pages 319 - 327, 1988.
26. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133 - 191. Elsevier Science Publishers, 1990.
27. W. Thomas. On the synthesis of strategies in infinite games. In Ernst W. Mayr and Claude Puech, editors, 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS'95, LNCS 900, pages 1 - 13. Springer-Verlag, 1995.
28. M.Y. Vardi. Verification of concurrent programs: the automata-theoretic framework. In Proc. of the Second IEEE Symposium on Logic in Computer Science, pages 167 - 176, 1987.
29. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:182-211, 1986.
30. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1-37, 1994.