Uniform Solution of Parity Games on Prefix-Recognizable Graphs

Thierry Cachat (1)

1 Lehrstuhl für Informatik VII, Logik und Theorie diskreter Systeme

Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable graphs. The winning regions of the players are proved to be effectively regular, and winning strategies are computed.

Mots clés: parity games; prefix-recognizable graphs; two-player games

Domaines: Informatique et théorie des jeux [cs.GT]

Thierry Cachat. Uniform Solution of Parity Games on Prefix-Recognizable Graphs. 2002, pp.68 (6). ⟨hal-00019913⟩