Collapsible Pushdown Parity Games
نویسندگان
چکیده
This article studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely, those generated by collapsible pushdown automata. The main motivation for studying these comes from the connections automata and higher-order recursion schemes, both models being equi-expressive generating trees. Our result is to establish decidability such provide an effective representation winning region as well strategy. Thus, results obtained here all necessary tools in-depth study logical properties trees automata/recursion schemes.
منابع مشابه
Playing Pushdown Parity Games in a Hurry
Introduction. Infinite two-player games on graphs are a powerful tool to model, verify, and synthesize open reactive systems and are closely related to fixed-point logics. The winner of a play in such a game typically emerges only after completing the whole (infinite) play. Despite this, McNaughton became interested in playing infinite games in finite time, motivated by his belief that “infinit...
متن کاملVariants of Collapsible Pushdown Systems
We analyze the relationship between three ways of generating trees using collapsible pushdown systems (CPS’s): using deterministic CPS’s, nondeterministic CPS’s, and deterministic wordaccepting CPS’s. We prove that (for each level of the CPS and each input alphabet) the three classes of trees are equal. The nontrivial translations increase n− 1 times exponentially the size of the level-n CPS. T...
متن کاملPlaying Pushdown Parity Games in a Hurry ( Extended 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 to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.
متن کاملParity Games on Bounded Phase Multi-pushdown Systems
In this paper we address the problem of solving parity games over the configuration graphs of bounded phase multi-pushdown systems. A non-elementary decision procedure was proposed for this problem by A. Seth. In this paper, we provide a simple and inductive construction to solve this problem. We also prove a non-elementary lower-bound, answering a question posed by A.Seth.
متن کاملPositional Strategies for Higher-Order Pushdown Parity Games
Higher-order pushdown systems generalize pushdown systems by using higher-order stacks, which are nested stacks of stacks. In this article, we consider parity games defined by higher-order pushdown systems and provide a k-Exptime algorithm to compute finite representations of positional winning strategies for both players for games defined by level-k higher-order pushdown automata. Our result i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2021
ISSN: ['1557-945X', '1529-3785']
DOI: https://doi.org/10.1145/3457214