Finite-State Strategies in Regular Infinite Games

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 generM regular games.

• Type: Conference
• Year: 1994
• Where: FSTTCS
• Authors: Wolfgang Thomas
• Keywords: FSTTCS 1994, GenerM Regular Games, Implement Winning Strategies, Infinite Two-person Games, Software Engineering