Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies

Given a set P of natural numbers, we consider infinite games where the winning condition is a regular ω-language parametrized by P. In this context, an ω-word, representing a play, has letters consisting of three components: The first is a bit indicating membership of the current position in P, and the other two components are the letters contributed by the two players. Extending recent work of Rabinovich we study here predicates P where the structure (N, +1, P) belongs to the pushdown hierarchy (or "Caucal hierarchy"). For such a predicate P where (N, +1, P) occurs in the k-th level of the hierarchy, we provide an effective determinacy result and show that winning strategies can be implemented by deterministic level-k pushdown automata.

[1]  Danilo Beuche,et al.  Report of the GI Work Group "Requirements Management Tools for Product Line Engineering" , 2006 .

[2]  Patrícia Duarte de Lima Machado,et al.  Unit Testing for CASL Architectural Specifications , 2002, MFCS.

[3]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[4]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[5]  Michel Rigo,et al.  Abstract numeration systems and tilings , 2005 .

[6]  Dirk Siefkes.  The recursive sets in certain monadic second order fragments of arithmetic , 1975, Arch. Math. Log..

[7]  Alexander Moshe Rabinovich,et al.  Decidable Theories of the Ordering of Natural Numbers with Unary Predicates , 2006, CSL.

[8]  Joost-Pieter Katoen,et al.  Abstraction for Stochastic Systems by Erlang's Method of Stages , 2008, CONCUR.

[9]  Jan Borchers,et al.  coJIVE: A System to Support Collaborative Jazz Improvisation , 2007 .

[10]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem Is Polynomial on Interval Graphs , 2009, MFCS.

[11]  Joachim Kneis,et al.  Satellites and Mirrors for Solving Independent Set on Sparse Graphs , 2009 .

[12]  Michaël Rusinowitch,et al.  Relating two standard notions of secrecy , 2006, Log. Methods Comput. Sci..

[13]  W. Thomas.  The theory of successor with an extra predicate , 1978 .

[14]  Wolfgang Thomas,et al.  Decision problems over infinite graphs : higher order pushdown systems and synchronized products , 2005 .

[15]  T. Kraußer,et al.  A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption , 2007 .

[16]  Thomas Noll,et al.  Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information , 2006, Acta Informatica.

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

[18]  George B. Mertzios,et al.  Preemptive Scheduling of Equal-Length Jobs in Polynomial Time , 2010, Math. Comput. Sci..

[19]  Jaikumar Radhakrishnan,et al.  FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science , 2004, Lecture Notes in Computer Science.

[20]  Shmuel Zaks,et al.  A New Intersection Model and Improved Algorithms for Tolerance Graphs , 2009, SIAM J. Discret. Math..

[21]  Frank G. Radmacher.  An Automata Theoretic Approach to the Theory of Rational Tree Relations , 2008 .

[22]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

[23]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[24]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[25]  J. Klop,et al.  WST ’ 04 7 th International Workshop on Termination , 2004 .

[26]  Andrea Walther,et al.  Adjoints for Time-Dependent Optimal Control , 2008 .

[27]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[28]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[29]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[30]  Nathan R. Tallent,et al.  ADJOINT CODE BY SOURCE TRANSFORMATION WITH OPENAD/F , 2006 .

[31]  Joachim Kneis,et al.  Derandomizing Non-uniform Color-Coding I , 2009 .

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

[33]  David Gale,et al.  13. Infinite Games with Perfect Information , 1953 .

[34]  George B. Mertzios,et al.  An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs , 2010, Math. Comput. Sci..

[35]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[36]  Yuxiao Hu,et al.  Optimal vertex elimination in single-expression-use graphs , 2008, TOMS.

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

[38]  Christof Löding,et al.  Unranked Tree Automata with Sibling Equalities and Disequalities , 2007, ICALP.

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

[40]  Joost-Pieter Katoen,et al.  Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[41]  Benedikt Bollig,et al.  Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning , 2007, TACAS.

[42]  Felix C. Freiling,et al.  An offensive approach to teaching information security : 'Aachen summer school applied IT security , 2005 .

[43]  Jan Borchers,et al.  Selexels: a Conceptual Framework for Pointing Devices with Low Expressiveness , 2006 .

[44]  Martin Zimmermann.  Time-Optimal Winning Strategies for Poset Games , 2009, CIAA.

[45]  Arnaud Carayol,et al.  Regular Sets of Higher-Order Pushdown Stacks , 2005, MFCS.

[46]  Felix C. Freiling,et al.  Byzantine Fault Tolerance on General Hybrid Adversary Structures , 2005 .

[47]  Alexander Moshe Rabinovich,et al.  The Church Synthesis Problem with Parameters , 2007, Log. Methods Comput. Sci..