Abstract
This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller automata and by game graphs (as introduced by McNaughton) is considered, and the construction of winning strategies is described in three stages, covering “guarantee games”, “recurrence games”, and general regular games.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Lamport, P. Wolper, Realizable and unrealizable specifications of reactive systems, in: Automata, Languages, and Programming (G. Ausiello et al., eds.), Lecture Notes in Computer Science 372 (1989), Springer-Verlag, Berlin 1989, pp. 1–17.
A. Church, Logic, arithmetic and automata, Proc. Intern. Congr. Math. 1960, Almqvist and Wiksells, Uppsala 1963.
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.
D. Gale, F.M. Stewart, Infinite games with perfect information, in: Contributions to the Theory of Games, Princeton Univ. Press, Princeton, NJ, 1953.
Y. Gurevich, L. Harrington, Trees, automata, and games, in: Proc. 14th ACM Symp. on the Theory of Computing, San Francisco, 1982, pp. 60–65.
D. Harel, A. Pnueli, On the development of reactive systems, in: NATO ASI Series, Vol F13, Springer-Verlag, New York 1985, pp. 477–498.
R. Hossley, C.W. Rackoff, The emptiness problem for automata on infinite trees, in: Proc. 13th IEEE Symp. on Switching and Automata Theory, 1972, 121–124.
O. Junge, Konstruktion und Klassifizierung von Strategien für unendliche Spiele auf endlichen Graphen, Diploma Thesis, Inst. f. Informatik u. Prakt. Math., Kiel 1994.
N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, in: Proc. 7th IEEE Symp. on Logic in Computer Science, 1992.
L.H. Landweber, Decision problems for ω-automata, Math. Systems Theory 3 (1969), 376–384.
D. Martin, Borel determinacy, Ann. Math. 102 (1975), 363–371.
R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65, 149–184.
Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berlin, Heidelberg, New York 1992.
A. Nerode, A. Yaklinis, V. Yakhnis, Concurrent programs as strategies in games, in: Logic from Computer Science (Y. Moschovakis, ed.), Springer-Verlag, New York 1992.
A. Nerode, A. Yakhnis, V. Yakhnis, Modelling hybrid systems as games, in: Proc. 31st IEEE Conf. on Decision and Control, Tucson, Arizona, 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, R.I., 1972.
S. Seibert, Doctoral Thesis, in preparation.
J.G. Thistle, W.M. Wonham, Control of ω-automata, Church's Problem, and the emptiness problem for tree ω-automata, in: Computer Science Logic (E. Börger et al. eds.), Lecture Notes in Computer Science 626, Springer-Verlag, Berlin 1992, pp. 367–381.
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.
W. Thomas, H. Lescow, Logical specifications of infinite computations, in: A Decade of Concurrency (J.W. de Bakker et al., eds.), Lecture Notes in Computer Science 803, Springer-Verlag, Berlin 1994, pp. 583–621.
B.A. Trakhtenbrot, Y.M. Barzdin, Finite Automata, North-Holland, Amsterdam 1973.
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 stategies, Ann. Pure Appl. Logic 48 (1990), 277–297.
A. Yakhnis, V. Yakhnis, Gurevich-Harrington games defined by finite automata, Rep. 92-25, Math. Sciences Inst., Cornell Univ., Ithaca, N.Y.
S. Zeitman, Unforgettable forgetful determinacy, J. Logic Computation 4 (1994), 273–283.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomas, W. (1994). Finite-state strategies in regular infinite games. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_121
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_121
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive