Playing Pushdown Parity Games in a Hurry
Wladimir Fridman, Martin Zimmermann
Electronic Proceedings in Theoretical Computer Science · 2012
doi:10.4204/eptcs.96.14 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows us to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.