Academic Journals Database
Disseminating quality controlled scientific knowledge

Playing Pushdown Parity Games in a Hurry

ADD TO MY LIST
 
Author(s): Wladimir Fridman | Martin Zimmermann

Journal: Electronic Proceedings in Theoretical Computer Science
ISSN 2075-2180

Volume: 96;
Issue: Proc. GandALF 2012;
Start page: 183;
Date: 2012;
Original page

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.
RPA Switzerland

Robotic Process Automation Switzerland

    

Tango Jona
Tangokurs Rapperswil-Jona