Article Dans Une Revue ACM Transactions on Computational Logic Année : 2021

Collapsible Pushdown Parity Games

Résumé

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.

Fichier principal
Vignette du fichier
main.pdf (692.63 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-03014435 , version 1 (17-05-2021)

Licence

Identifiants

Citer

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C. -H. Luke Ong, et al.. Collapsible Pushdown Parity Games. ACM Transactions on Computational Logic, 2021, 22 (3), pp.16:1-16:51. ⟨10.1145/3457214⟩. ⟨hal-03014435⟩
150 Consultations
455 Téléchargements

Altmetric

Partager

  • More