Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2021

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

Résumé

This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider three main problems -- model-checking, logical refection (aka global model-checking) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively. For that, we rely on the known connexion between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.
Fichier principal
Vignette du fichier
BCOS21.pdf (527.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

Christopher H. Broadbent, Arnaud Carayol, C. -H. Luke Ong, Olivier Serre. Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. ACM Transactions on Computational Logic, 2021, 22 (2), ⟨10.1145/3452917⟩. ⟨hal-03014425⟩
35 Consultations
66 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More