On the synthesis of strategies in infinite games

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

Volumn 900, Issue , 1995, Pages 1-13

  Thomas, Wolfgang ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FINITE STATE; GAME GRAPHS; INFINITE GAME; INFINITE GRAPH; NEW CONSTRUCTIONS; REACTIVE PROGRAMS; TWO PERSON GAME; WINNING STRATEGY;

ARTIFICIAL INTELLIGENCE;

EID: 38149135474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_57     Document Type: Conference Paper

References (33)

1. [ALW89] M. Abadi, L. Lamport, P. Wolper, Realizable and unrealizable specifications of reactive systems, in: Proc. 17th ICALP (G..Ausiello et al., eds.), Lecture Notes in Computer Science 372 (1989), Springer, p-Verlag, Berlin 1989p. 1-17.
2. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Proe. Int. Congr. Logic, Method. and Philos. of Science (E. Nagel et al., eds.), Stanford Univ. Press, Stanford 1962, pp. 1-11.
3. J.R. Büchi, Using determinacy to elimin'ate quantifiers, in: Fundamentals of Computation Theory (M. Karpinski, ed.), Lecture Notes in Computer Science 56, Springer-Verlag, Berlin 1977, pp. 367-378.
4. J.R. Büchi, State-strategies for games in FN G6,,, J. Symb. Logic 48 (1983), 1171-1198.
5. [BL69] J.R. Biichi, L.H. Landweber, Solving sequential conditions by finite-state strategies, Trans. Amer. Math. Soc. 138 (1969), 295-311.
6. O. Carton, Chain automata, in: Technology and Applications, Information Processing '94, Vol. I (B. Pherson, I. Simon, eds.), IFIP, North-Holland, Amsterdam 1994, pp. 451-458.
7. A. Church, Logic, arithmetic and automata, Proe. Intern. Congr. Math. 1962, Almqvist and Wiksells, Uppsala 1963, pp. 21-35.
8. [CGL94] E. Clarke, O. Grumberg, D. Long, Verification tools for finite-state concurrent systems, in: A Decade of Concurrency (J.W. de Bakker et al., eds.), Lecture Notes in Computer Science 803, Springer-Verlag, Berlin 1994, pp. 124-175.
9. B. Courcelle, Fundamental properties of infinite trees, Theor. Comput. Sci. 25 (1983), 95-169.
10. B. Courcelle, The monadic second-order theory of graphs IX: Machines and their behaviours, Techn. Report, LaBRI; Universit6 Bordeaux I, 1994.
11. E.A. Emerson, C.S. Jutla, Tree automata, Mu-calculus and determinacy, in: Proc. 32th Syrup. on Foundations of Computer Science (1991), 368-377.
12. [GH82] Y. Gurevich, L. Harrington, Trees, automata, and games, in: Proe. 14th ACM Syrup. on the Theory of Computing, San Francisco, 1982, pp. 60-65.
13. [K194] N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, Ann. Pure Appl. Logic 69 (1994), 243-168.
14. D. Martin, Borel determinacy, Ann. Math. 102 (1975), 363-371.
15. R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65 (1993), 149-184.
16. [MP92] Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berin, Heidelberg, New York 1992.
17. Y. N. Moschovakis, Descriptive Set Theory, North-Holland, Amsterdam 1980.
18. O. Maler, A. Pnueli, J. Sifakis, On the synthesis of discrete controllers for timed systems, these Proceedings.
19. A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, in: A. Skowron (ed.), Computation Theory, Lecture Notes in Computer Science 208, Springer-Verlag, Berlin 1984, pp. 157-168.
20. A.W. Mostowski, Games with forbidden positions, Preprint No. 78, Uniwersytet Gdafiski, Instytyt Matematyki, 1991.
21. A.W. Mostowski, Hierarchies of weak automata and weak monadic formulas, Theor. Comput. Sci. 83 (1991), 323-335.
22. A. Muchnik, Games on infinite trees and automata with dead-ends. A new proof for the decidability of the monadic second-order theory of two successors, Bull. of the EATCS 48 (1992), 220-267.
23. [MS85] D.E. Muller, P.E. Schupp, The theory of ends, pushdown automata and second-order logic, Theor. Comput. Sci. 37 (1985), 51-75.
24. D.E. Muller, P.E. Schupp, Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra, Theor. Comput. Sci. (to appear).
25. A. Nerode, A. Yakhnis, V. Yakhnis, Concurrent programs as strategies in games, in: Logic from Computer Science (Y. Moschovakis, ed.), Springer, 1992.
26. A. Nerode, A. Yakhnis, V. Yakhnis, Modelling hybrid systems as games, in: Proc. 31st IEEE Conf. on Decision and Control, Tucson, pp. 2947-2952.
27. [PR89] A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. 16th ACM Syrup. on Principles of Progr. Lang., Austin, pp. 179-190.
28. M.O. Rabin, Automata on infinite objects and Church's Problem, Amer. Math. Soc., Providence, RI, 1972.
29. [RW89] P.J.G. Ramadge, W.M. Wonham, The control of discrete event systems, Proc. of the IEEE 77 (1989), 81-98.
30. S. Seibert, DoctorM Thesis, in preparation.
31. W. Thomas, Automata on infinite objects, in: J. v. Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B., Elsevier Science Publ., Amsterdam 1990, pp. 133-191.
32. [YY90] A. Yakhnis, V. Yakhnis, Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies, Ann. Pure Appt. Logic 48 (1990), 277-297.
33. S. Zeitman, Unforgettable forgetful determinacy, J. Logic Computation 4 (1994), 273-283.