Abstract
Infinite two-person games are a natural framework for the study of reactive nonterminating programs. The effective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of infinite games (given by “game graphs”), outline a new construction of winning strategies in finite-state games, and formulate some questions which arise for games over effectively presented infinite graphs.
This work was supported by the ESPRIT Basic Research Action 6317 ASMICS (“Algebraic and Syntactic Methods in Computer Science”)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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-Verlag, Berlin 1989, pp. 1–17.
J.R. Büchi, On a decision method in restricted second order arithmetic, in: Proc. Int. Congr. Logic, Method. and Philos. of Science (E. Nagel et al., eds.), Stanford Univ. Press, Stanford 1962, pp. 1–11.
J.R. Büchi, Using determinacy to eliminate quantifiers, in: Fundamentals of Computation Theory (M. Karpinski, ed.), Lecture Notes in Computer Science 56, Springer-Verlag, Berlin 1977, pp. 367–378.
J.R. Büchi, State-strategies for games in F σδ ∩G δσ , J. Symb. Logic 48 (1983), 1171–1198.
J.R. Büchi, L.H. Landweber, Solving sequential conditions by finite-state strategies, Trans. Amer. Math. Soc. 138 (1969), 295–311.
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.
A. Church, Logic, arithmetic and automata, Proc. Intern. Congr. Math. 1962, Almqvist and Wiksells, Uppsala 1963, pp. 21–35.
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.
B. Courcelle, Fundamental properties of infinite trees, Theor. Comput. Sci. 25 (1983), 95–169.
B. Courcelle, The monadic second-order theory of graphs IX: Machines and their behaviours, Techn. Report, LaBRI; Université Bordeaux I, 1994.
E.A. Emerson, C.S. Jutla, Tree automata, Mu-calculus and determinacy, in: Proc. 32th Symp. on Foundations of Computer Science (1991), 368–377.
Y. Gurevich, L. Harrington, Trees, automata, and games, in: Proc. 14th ACM Symp. on the Theory of Computing, San Francisco, 1982, pp. 60–65.
N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, Ann. Pure Appl. Logic 69 (1994), 243–168.
D. Martin, Borel determinacy, Ann. Math. 102 (1975), 363–371.
R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65 (1993), 149–184.
Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berin, Heidelberg, New York 1992.
Y. N. Moschovakis, Descriptive Set Theory, North-Holland, Amsterdam 1980.
O. Maler, A. Pnueli, J. Sifakis, On the synthesis of discrete controllers for timed systems, these Proceedings.
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.
A.W. Mostowski, Games with forbidden positions, Preprint No. 78, Uniwersytet Gdański, Instytyt Matematyki, 1991.
A.W. Mostowski, Hierarchies of weak automata and weak monadic formulas, Theor. Comput. Sci. 83 (1991), 323–335.
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.
D.E. Muller, P.E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput. Sci. 37 (1985), 51–75.
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).
A. Nerode, A. Yakhnis, V. Yakhnis, Concurrent programs as strategies in games, in: Logic from Computer Science (Y. Moschovakis, ed.), Springer, 1992.
A. Nerode, A. Yakhnis, V. Yakhnis, Modelling hybrid systems as games, in: Proc. 31st IEEE Conf. on Decision and Control, Tucson, pp. 2947–2952.
A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. 16th ACM Symp. on Principles of Progr. Lang., Austin, pp. 179–190.
M.O. Rabin, Automata on infinite objects and Church's Problem, Amer. Math. Soc., Providence, RI, 1972.
P.J.G. Ramadge, W.M. Wonham, The control of discrete event systems, Proc. of the IEEE 77 (1989), 81–98.
S. Seibert, Doctoral Thesis, in preparation.
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.
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 Appl. Logic 48 (1990), 277–297.
S. Zeitman, Unforgettable forgetful determinacy, J. Logic Computation 4 (1994), 273–283.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomas, W. (1995). On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_57
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive