Parity Games Played on Transition Graphs of One-Counter Processes

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 [22] that deciding the winner is an ExpTime-complete problem. An important corollary of this result is that the

• Type: Conference
• Year: 2006
• Where: FOSSACS
• Authors: Olivier Serre
• Keywords: FOSSACS 2006, Parity Game, Pushdown, Pushdown Graphs, Software Engineering