Collapsible Pushdown Parity Games

10/13/2020
by   Christopher H. Broadbent, et al.
0

This paper 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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 5

10/13/2020

Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

This paper studies the logical properties of a very general class of inf...
11/21/2021

Solving Infinite Games in the Baire Space

Infinite games (in the form of Gale-Stewart games) are studied where a p...
09/10/2018

Parameterized Games and Parameterized Automata

We introduce a way to parameterize automata and games on finite graphs w...
09/16/2018

Observation and Distinction. Representing Information in Infinite Games

We compare two approaches for modelling imperfect information in infinit...
10/24/2017

Permutation Games for the Weakly Aconjunctive mu-Calculus

We introduce a natural notion of limit-deterministic parity automata and...
07/22/2019

Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis

We propose "semantic labelling" as a novel ingredient for solving games ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.