Parity games played on transition graphs of one-counter processes

Olivier Serre (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [Wal96] that deciding the winner is an Exptime-complete problem. An important corollary of this result is that the mu-calculus model checking problem for pushdown processes is Exptime-complete. As one-counter processes are special cases of pushdown processes, it follows that deciding the winner in a parity game played on the transition graph of a one-counter process can be achieved in Exptime. Nevertheless the proof for the Exptime-hardness lower bound of [Wal] cannot be adapted to that case. Therefore, a natural question is whether the Exptime upper bound can be improved in this special case. In this paper, we adapt techniques from [KV00,Cac02c] and provide a Pspace upper bound and a DP-hard lower bound for this problem. We also give two important consequences of this result. First, we improve the best upper bound known for model-checking one-counter processes against mu-calculus. Second, we show how these games can be used to solve pushdown games with winning conditions that are Boolean combinations of a parity condition on the control states with conditions on the stack height.

Mots clés: Pushdown Automata; One-counter Automata; Two-player Games; mu-calculus model-checking

Domaines: Informatique et langage [cs.CL]

Olivier Serre. Parity games played on transition graphs of one-counter processes. FOSSACS 2006: Foundations of Software Science and Computation Structures, 2006, Vienna, Austria. pp.337-351. ⟨hal-00016665⟩