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

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

[1]  A. Church,et al.  Some properties of conversion , 1936 .

[2]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[3]  Alfred V. Aho,et al.  Translations on a context free grammar , 1969, STOC.

[4]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[5]  Alfred V. Aho,et al.  Translations on a Context-Free Grammar , 1971, Inf. Control..

[6]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[7]  Saharon Shelah,et al.  Rabin's uniformization problem , 1983, Journal of Symbolic Logic.

[8]  Werner Damm,et al.  An Automata-Theoretical Characterization of the OI-Hierarchy , 1986, Inf. Control..

[9]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[10]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[11]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours , 1995, Theor. Comput. Sci..

[12]  Igor Walukiewicz,et al.  On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[13]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[14]  Jan-Pascal van Best,et al.  Trips on Trees , 1999, Acta Cybern..

[15]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[16]  Thomas Wilke,et al.  Alternating tree automata, parity games, and modal {$\mu$}-calculus , 2001 .

[17]  Pawel Urzyczyn,et al.  Deciding Monadic Theories of Hyperalgebraic Trees , 2001, TLCA.

[18]  André Arnold,et al.  Rudiments of Mu-calculus , 2001 .

[19]  Didier Caucal.  On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.

[20]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

[21]  Arnaud Carayol,et al.  The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata , 2003, FSTTCS.

[22]  I. Walukiewicz.  A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[23]  Moshe Y. Vardi,et al.  Global Model-Checking of Infinite-State Systems , 2004, CAV.

[24]  Klaus Aehlig,et al.  Safety Is not a Restriction at Level 2 for String Languages , 2005, FoSSaCS.

[25]  Igor Walukiewicz,et al.  Unsafe Grammars and Panic Automata , 2005, ICALP.

[26]  Klaus Aehlig.  A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata , 2006, CSL.

[27]  Arnaud Carayol.  Automates infinis, logiques et langages , 2006 .

[28]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[29]  Christof Löding,et al.  MSO on the Infinite Binary Tree: Choice and Order , 2007, CSL.

[30]  Antoine Meyer,et al.  Winning Regions of Higher-Order Pushdown Games , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[31]  Andrzej S. Murawski,et al.  Collapsible Pushdown Automata and Recursion Schemes , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[32]  Arnaud Carayol,et al.  Positional Strategies for Higher-Order Pushdown Parity Games , 2008, MFCS.

[33]  Andrzej S. Murawski,et al.  Collapsible Pushdown Automata and Recursion Schemes , 2008, LICS.

[34]  C.-H. Luke Ong,et al.  On Global Model Checking Trees Generated by Higher-Order Recursion Schemes , 2009, FoSSaCS.

[35]  Naoki Kobayashi.  Types and higher-order recursion schemes for verification of higher-order programs , 2009, POPL '09.

[36]  C.-H. Luke Ong,et al.  A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[37]  C.-H. Luke Ong,et al.  Recursion Schemes and Logical Reflection , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[38]  Axel Haddad.  IO vs OI in Higher-Order Recursion Schemes , 2012, FICS.

[39]  Pawel Parys.  On the Significance of the Collapse Operation , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[40]  Olivier Serre,et al.  Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[41]  Axel Haddad.  Model Checking and Functional Program Transformations , 2013, FSTTCS.

[42]  Using Models to Model-Check Recursive Schemes , 2015, TLCA.

[43]  Axel Haddad.  Shape-Preserving Transformations of Higher-Order Recursion Schemes , 2013 .

[44]  Paul-André Melliès,et al.  Finitary Semantics of Linear Logic and Higher-Order Model-Checking , 2015, MFCS.

[45]  Pawel Parys.  Recursion Schemes and the WMSO+U Logic , 2018, STACS.

[46]  Patricia Bouyer,et al.  Automata, Logics and Games for Infinite Trees , 2019 .

[47]  Andrzej S. Murawski,et al.  Collapsible Pushdown Parity Games , 2020, ArXiv.