Collapsible Pushdown Parity Games-Reference-Cited by-同舟云学术

Collapsible Pushdown Parity Games

Published:2021-06-24 Issue:3 Volume:22 Page:1-51
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Broadbent Christopher H.¹,Carayol Arnaud²,Hague Matthew³,Murawski Andrzej S.¹,Ong C.-H. Luke¹,Serre Olivier⁴

Affiliation:

1. Department of Computer Science, University of Oxford, UK

2. CNRS, LIGM (Université Paris Est & CNRS), France

3. Royal Holloway, University of London, UK

4. Université de Paris, IRIF, CNRS, France

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3457214

Reference38 articles.

1. Safety Is not a Restriction at Level 2 for String Languages

2. André Arnold and Damian Niwiński. 2001. Rudiments of mu-Calculus(Studies in Logic and the Foundations of Mathematics Vol. 146). Elsevier. André Arnold and Damian Niwiński. 2001. Rudiments of mu-Calculus(Studies in Logic and the Foundations of Mathematics Vol. 146). Elsevier.

3. Symbolic Reachability Analysis of Higher-Order Context-Free Processes

4. A Saturation Method for Collapsible Pushdown Systems