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.
Cite
CITATION STYLE
Thomas, W. (1995). On the synthesis of strategies in infinite games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 900, pp. 1–13). Springer Verlag. https://doi.org/10.1007/3-540-59042-0_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
