Advertisement
Published in:
1995 | ReviewPaper | Chapter
On the synthesis of strategies in infinite games
Author : Wolfgang Thomas
Published in: STACS 95
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.