文章基本信息

标题：Playing Pushdown Parity Games in a Hurry
本地全文：下载
作者：Wladimir Fridman ; Martin Zimmermann
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2012
卷号：96
页码：183-196
DOI：10.4204/EPTCS.96.14
出版社：Open Publishing Association
摘要：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.