Games on Higher Order Multi-stack Pushdown Systems

In this paper we define higher order multi-stack pushdown systems. We show that parity games over bounded phase higher order multi-stack pushdown systems are effectively solvable and winning strategy in these games can be effectively synthesized.

[1]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[2]  Kousha Etessami,et al.  Verifying Probabilistic Procedural Programs , 2004, FSTTCS.

[3]  Anil Nerode,et al.  Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings , 1994, LFCS.

[4]  Joost Engelfriet,et al.  Iterated pushdown automata and complexity classes , 1983, STOC.

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

[6]  Antoine Meyer,et al.  Symbolic Reachability Analysis of Higher-Order Context-Free Processes , 2004, FSTTCS.

[7]  Anil Seth.  Games on Multi-stack Pushdown Systems , 2009, LFCS.

[8]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[9]  Salvatore La Torre,et al.  Context-Bounded Analysis of Concurrent Queue Systems , 2008, TACAS.

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

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

[12]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

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

[14]  Thierry Cachat,et al.  Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games , 2003, ICALP.

[15]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[16]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[17]  Jakob Rehof,et al.  Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.

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

[19]  Thierry Cachat,et al.  Uniform Solution of Parity Games on Prefix-Recognizable Graphs , 2003, INFINITY.

[20]  Salvatore La Torre,et al.  A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).