Winning regions of pushdown parity games: A saturation method

14Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 a clean proof of correctness. Our algorithm is simple and direct, and it permits an optimisation that avoids an immediate exponential blow up. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hague, M., & Ong, C. H. L. (2009). Winning regions of pushdown parity games: A saturation method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5710 LNCS, pp. 384–398). https://doi.org/10.1007/978-3-642-04081-8_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free