Winning Regions of Pushdown Parity Games: A Saturation Method

We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the parity condition. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton transformations to compute a fixed-point characterisation of the winning region. We introduce notions of under-approximation (soundness) and over-approximation (completeness) that apply to automaton transitions rather than runs, and obtain clean proof of correctness. Our algorithm is simple and direct, and it permits an optimisation that avoids an immediate exponential blow up.

• Type: Conference
• Year: 2009
• Where: CONCUR
• Authors: Matthew Hague, C.-H. Luke Ong
• Keywords: Automaton Transformations, CONCUR 2009, Distributed And Parallel Computing, Initial Automaton, Pushdown System