Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games

Thierry Cachat (1)

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

We consider two-player parity games played on transition graphs of higher order pushdown automata. They are ``game-equivalent'' to a kind of model-checking game played on graphs of the infinite hierarchy introduced recently by Caucal. Then in this hierarchy we show how to reduce a game to a graph of lower level. This leads to an effective solution and a construction of the winning strategies.

Mots clés: parity games; strategy synthesis; automata; higher order pushdown automata; infinite graphs

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

Thierry Cachat. Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games. 2003, pp.556-569. ⟨hal-00019874⟩