Strategy construction in infinite games with streett and rabin chain winning conditions

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

Volumn 1055, Issue , 1996, Pages 207-224

  Buhrke, Nils ^a   Lescow, Helmut ^a   Vöge, Jens ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SPECIFICATIONS;

ACCEPTANCE CONDITIONS; FINITE STATE; INFINITE GAME; PROGRAM SYNTHESIS; STREETT AUTOMATA; WINNING CONDITIONS; WINNING STRATEGY;

CHAINS;

EID: 34447271745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61042-1_46     Document Type: Conference Paper

References (22)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. In G. Ausiello et al., editor, Automata, Languages, and Programming, volume 372 of LNCS, pages 1-17, Berlin, Heidelberg, New York, 1989. Springer-Verlag.
2. E. Asarin, O. Maler, and A. Pnueli. Symbolic controller synthesis for discrete and timed systems. In P. Antsaklis et al., editor, Hybrid Systems II, volume 999 of LNCS, pages 1-20, Berlin, Heidelberg, New-York, 1995. Springer-Verlag.
3. J. R. Biichi and L. H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295-311, 1969.
4. J. R. Büchi. State strategies for games in Fσ∞ ∩ Gδσ. J. Symb. Logic, 48:1171-1198, 1983.
5. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Symp. on the Foundations of Computing, pages 368-377, 1991.
6. Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc 14th ACM Symp. on the Theory of computing, pages 60-65, San Fancisco, 1982.
7. D. Gale and F. M. Stewart. Infinite games with perfect information. Annals of Mathematical Studies, 28:245-266, 1953.
8. R. Kumar and V. K. Garg. Modeling and Control of Logical Discrete Event Systems. Kluwer Academic Publishers, Norwell, MA, USA, 1995.
9. R. McNaughton. Infinite games played on finite graphs. Ann. Pure Appl Logic, 65:149-184, 1993.
10. A.W. Mostowski. Games with forbidden positions. Technical Report Preprint No. 78, Uniwersytet Gdafiski, Instytyt Matematyki, 1991.
11. D.E. Muller and P.E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141:69-107, 1995.
12. A. Muchnik. Games on infinite trees and automata with deadends: A new proof for the decidability of the monadic second order theory of two successors. Bulletin of the European Association for Theoretical Computer Science, 48:220-267, 1992.
13. A. Nerode, A. Yakhnis, and V. Yakhnis. Concurrent programs as strategies in games. In Moschovakis Y., editor, Logic from Computer Science. Springer, 1992.
14. A. Pnueli and R. Rosner. On the systhesis of a reactive module. In Proc. 16th ACM Sympos. on Principles of Prog. Lang., pages 179-190, Austin, 1989.
15. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
16. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77, 1:81-98, 1989.
17. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. 24th ACM Symposium on Theory of Computing (STOC), pages 275-282, 1992.
18. R.S. Streett. Propositional dynamic logic of looping and converse. Information and Control, 54:121-141, 1982.
19. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 131-191. North-Holland, Amsterdam, 1990.
20. W. Thomas. On the synthesis of strategies in infinite games. In Ernst W. Mayr and Claude Puech, editors, STACS 95, volume 900 of LNCS, pages 1-13, Berlin, Heidelberg, New-York, 1995. Springer-Verlag.
21. J.G. Thistle and W.M. Wonham. Control of infinite behaviour of finite automata. SIAM J. of Control and Optimization, 32(4):1075-1097, 1994.
22. A. Yakhnis and V. Yakhnis. Gurevich-Harrington's games defined by finite automata. Ann. Pure Appl Logic, 62:265-294, 1993.