Multi-buffer simulations: Decidability and complexity

Abstract Multi-buffer simulation is a refinement of fair simulation between two nondeterministic Buchi automata (NBA). It is characterised by a game in which letters get pushed to and taken from FIFO buffers of bounded or unbounded capacity. Games with a single buffer approximate the PSPACE-complete language inclusion problem for NBA. With multiple buffers and a fixed mapping of letters to buffers these games approximate the undecidable inclusion problem between Mazurkiewicz trace languages. We study the decidability and complexity of multi-buffer simulations and obtain the following results: P-completeness for fixed bounded buffers, EXPTIME-completeness in case of a single unbounded buffer and high undecidability (in the analytic hierarchy) with two buffers of which at least one is unbounded. We also consider a variant in which the buffers are kept untouched or flushed and show PSPACE-completeness for the single-buffer case.

[1]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[2]  Thomas Wilke,et al.  Simulation relations for alternating Büchi automata , 2005, Theor. Comput. Sci..

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

[4]  Olivier Finkel,et al.  Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language , 2011, Int. J. Found. Comput. Sci..

[5]  Norbert Hundeshagen,et al.  Two-Buffer Simulation Games , 2016, Cassting/SynCoP.

[6]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[7]  Norbert Hundeshagen,et al.  Multi-Buffer Simulations for Trace Language Inclusion , 2016, GandALF.

[8]  Lorenzo Clemente,et al.  Advanced automata minimization , 2012, POPL.

[9]  Martin Lange,et al.  Buffered Simulation Games for Büchi Automata , 2014, AFL.

[10]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[11]  Lukasz Kaiser,et al.  Degrees of Lookahead in Regular Infinite Games , 2010, Log. Methods Comput. Sci..

[12]  Parosh Aziz Abdulla,et al.  Computing Simulations over Tree Automata , 2008, TACAS.

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

[14]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[15]  Thomas A. Henzinger,et al.  Fair Simulation , 1997, Inf. Comput..

[16]  Peter van Emde Boas,et al.  The Convenience of Tilings , 2019, complexity, logic, and recursion theory.

[17]  Bogdan S. Chlebus.  Domino-Tiling Games , 1986, J. Comput. Syst. Sci..

[18]  David Harel,et al.  Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.

[19]  Kousha Etessami,et al.  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.

[20]  Jacques Sakarovitch.  The "Last" Decision Problem for Rational Trace Languages , 1992, LATIN.

[21]  Hartley Rogers.  Theory of recursive functions and effective computability (Reprint from 1967) , 1987 .

[22]  Martin Lange,et al.  Revealing vs. Concealing: More Simulation Games for Büchi Inclusion , 2013, LATA.

[23]  Volker Diekert,et al.  The Book of Traces , 1995 .