Playing Pushdown Parity Games in a Hurry

Playing Pushdown Parity Games in a Hurry

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 t...

Full description

Bibliographic Details
Main Authors: Wladimir Fridman, Martin Zimmermann
Format: Article
Language:English
Published: Open Publishing Association 2012-10-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1210.2458v1
id doaj-a00cc12821784e3796ecd83798ff7b8f
record_format Article
spelling doaj-a00cc12821784e3796ecd83798ff7b8f2020-11-25T00:32:55ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-10-0196Proc. GandALF 201218319610.4204/EPTCS.96.14Playing Pushdown Parity Games in a HurryWladimir FridmanMartin ZimmermannWe 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.http://arxiv.org/pdf/1210.2458v1
collection DOAJ
language English
format Article
sources DOAJ
author Wladimir Fridman
Martin Zimmermann
spellingShingle Wladimir Fridman
Martin Zimmermann
Playing Pushdown Parity Games in a Hurry
Electronic Proceedings in Theoretical Computer Science
author_facet Wladimir Fridman
Martin Zimmermann
author_sort Wladimir Fridman
title Playing Pushdown Parity Games in a Hurry
title_short Playing Pushdown Parity Games in a Hurry
title_full Playing Pushdown Parity Games in a Hurry
title_fullStr Playing Pushdown Parity Games in a Hurry
title_full_unstemmed Playing Pushdown Parity Games in a Hurry
title_sort playing pushdown parity games in a hurry
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-10-01
description 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.
url http://arxiv.org/pdf/1210.2458v1
work_keys_str_mv AT wladimirfridman playingpushdownparitygamesinahurry
AT martinzimmermann playingpushdownparitygamesinahurry
_version_ 1725318379067146240

Similar Items