Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/collapsible-pushdown-parity-games-csTZLnkX43
References (49)
-
Arnaud Carayol, Antoine Meyer, Matthew Hague, C.-H. Luke Ong, Olivier Serre (2008)
Winning regions of higher-order pushdown gamesProceedings of the 23rd IEEE Symposium on Logic in Computer Science (LiCS’08). IEEE Computer Society
-
T. Wilke (2001)
Alternating tree automata, parity games, and modal {$\mu$}-calculusBulletin of The Belgian Mathematical Society-simon Stevin, 8
-
D. Niwinski, A. Arnold (2001)
Rudiments of Mu-calculus -
CPDA with a state set of size O(2 2| | ( | |+3) +5 ), a stack alphabet of size O(|Γ| 2 · 2 | | ( | |+1) +5 ) and an unchanged number of colours -
(1975)
Borel determinacy -
Thierry Cachat (2003)
Games on pushdown graphs and extensions -
Klaus Aehlig, Jolie Miranda, C. Ong (2005)
Safety Is not a Restriction at Level 2 for String Languages -
D. Muller, P. Schupp (1985)
The Theory of Ends, Pushdown Automata, and Second-Order LogicTheor. Comput. Sci., 37
-
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre (2008)
Collapsible pushdown automata and recursion schemesProceedings of the 23rd IEEE Symposium on Logic in Computer Science (LiCS’08). IEEE Computer Society
-
André Arnold, Damian Niwiński (2001)
Rudiments of mu-Calculus(Studies in Logic and the Foundations of Mathematics, Vol -
A. Bouajjani, A. Meyer (2004)
Symbolic Reachability Analysis of Higher-Order Context-Free ProcessesArXiv, abs/0705.3888
-
Arnaud Carayol, Olivier Serre (2012)
Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selectionProceedings of the 27th IEEE Symposium on Logic in Computer Science (LiCS’12). IEEE Computer Society
-
Olivier Serre (2004)
Contribution à l'étude des jeux sur des graphes de processus à pile -
Christopher Broadbent (2012)
The Limits of Decidability for First Order Logic on CPDA Graphs -
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre (2010)
Recursion schemes and logical reflexionProceedings of the 25th IEEE Symposium on Logic in Computer Science (LiCS’10). IEEE Computer Society
-
Christopher Broadbent, Arnaud Carayol, M. Hague, O. Serre (2013)
C-SHORe: a collapsible approach to higher-order verificationProceedings of the 18th ACM SIGPLAN international conference on Functional programming
-
Moshe Vardi (1998)
Reasoning about The Past with Two-Way Automata -
M. Hague, A. Murawski, C. Ong, O. Serre (2008)
Collapsible Pushdown Automata and Recursion Schemes2008 23rd Annual IEEE Symposium on Logic in Computer Science
-
Christopher Broadbent, Arnaud Carayol, C. Ong, O. Serre (2020)
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical PropertiesArXiv, abs/2010.06366
-
Arnaud Carayol, O. Serre (2012)
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection2012 27th Annual IEEE Symposium on Logic in Computer Science
-
Arnaud Carayol, Michaela Slaats (2008)
Positional Strategies for Higher-Order Pushdown Parity Games -
Y. Gurevich, L. Harrington (1982)
Trees, automata, and games -
Thierry Cachat (2003)
Uniform Solution of Parity Games on Prefix-Recognizable Graphs -
M. Hague, C. Ong (2007)
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown SystemsLog. Methods Comput. Sci., 4
-
Michael O. Rabin (1969)
Decidability of second-order theories and automata on infinite treesTrans. Amer. Math. Soc, 141
-
Stefan Wöhrle, W. Thomas (2004)
Model checking synchronized products of infinite transition systemsProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
-
I. Walukiewicz (1996)
Pushdown Processes: Games and Model-Checking -
Arnaud Carayol (2005)
Regular Sets of Higher-Order Pushdown Stacks -
E. Emerson, C. Jutla (1991)
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) -
Matthew Hague (2008)
Global Model Checking of Higher-order Pushdown SystemsPh.D. Dissertation. University of Oxford.
-
Arnaud Carayol, M. Hague, A. Meyer, C. Ong, O. Serre (2008)
Winning Regions of Higher-Order Pushdown Games2008 23rd Annual IEEE Symposium on Logic in Computer Science
-
O. Serre (2017)
Note on winning positions on pushdown games with omega-regular winning conditions -
Christopher Broadbent, Arnaud Carayol, M. Hague, O. Serre (2012)
A Saturation Method for Collapsible Pushdown Systems -
M. Rabin (1968)
Decidability of second-order theories and automata on infinite treesBulletin of the American Mathematical Society, 74
-
Teodor Knapik, D. Niwinski, P. Urzyczyn, I. Walukiewicz (2005)
Unsafe Grammars and Panic Automata -
B. Courcelle (1994)
Monadic Second-Order Definable Graph Transductions: A SurveyTheor. Comput. Sci., 126
-
Stefan Wöhrle, Wolfgang Thomas (2007)
Model checking synchronized products of infinite transition systemsLog. Meth. Comput. Sci., 3
-
David (1985)
EMuller and Paul. E. Schupp, 37
-
W. Thomas (1997)
Languages, Automata, and Logic -
Alexander Kartzow (2009)
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic -
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre (2017)
Collapsible pushdown automata and recursion schemesACM Trans. Computat. Log., 18
-
J. Engelfriet (1991)
Iterated Stack Automata and Complexity ClassesInf. Comput., 95
-
Igor Walukiewicz (2004)
A landscape with games in the backgroundProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
-
D. Caucal (2002)
On Infinite Terms Having a Decidable Monadic Theory -
Thierry Cachat, I. Walukiewicz (2007)
The Complexity of Games on Higher Order Pushdown AutomataArXiv, abs/0705.0262
-
Christopher Broadbent, Arnaud Carayol, C. Ong, O. Serre (2010)
Recursion Schemes and Logical Reflection2010 25th Annual IEEE Symposium on Logic in Computer Science
-
M. Hague, C. Ong (2011)
A saturation method for the modal μ-calculus over pushdown systemsInf. Comput., 209
-
C. Stirling (2009)
Dependency Tree Automata -
Thierry Cachat (2003)
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2021 Association for Computing Machinery.
- ISSN
- 1529-3785
- eISSN
- 1557-945X
- DOI
- 10.1145/3457214
- Publisher site
- See Article on Publisher Site
Abstract
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 games comes from the connections from collapsible pushdown automata and higher-order recursion schemes, both models being equi-expressive for generating infinite trees. Our main result is to establish the decidability of such games and to provide an effective representation of the winning region as well as of a winning strategy. Thus, the results obtained here provide all necessary tools for an in-depth study of logical properties of trees generated by collapsible pushdown automata/recursion schemes.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 22, 2021
Keywords: Higher-order (collapsible) pushdown automata