The Complexity of Games on Higher Order Pushdown Automata

Thierry Cachat (1) , Igor Walukiewicz (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the mu-calculus model checking over graphs given by n-HPDA is n-EXPTIME complete.

Mots clés: complexity; game-theory; lower-bound; Higher Order Pushdown Automata

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

Thierry Cachat, Igor Walukiewicz. The Complexity of Games on Higher Order Pushdown Automata. 2007. ⟨hal-00144226⟩