Reachability Games on Extended Vector Addition Systems with States

We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding thewinner in such games in undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configurations.

[1]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

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

[3]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[4]  Faron Moller,et al.  Simulation and Bisimulation over One-Counter Processes , 2000, STACS.

[5]  Anton ´ õn Kuÿ.  Reachability Games on Extended Vector Addition Systems with States , 2010 .

[6]  P. Abdulla,et al.  Simulation Is Decidable for One-Counter Nets , 2022 .

[7]  Hsu-Chun Yen,et al.  A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems , 1985, J. Comput. Syst. Sci..

[8]  Stéphane Demri,et al.  The Covering and Boundedness Problems for Branching Vector Addition Systems , 2009, FSTTCS.

[9]  Parosh Aziz Abdulla,et al.  Simulation Is Decidable for One-Counter Nets (Extended Abstract) , 1998, CONCUR.

[10]  Stéphane Demri,et al.  Model Checking Freeze LTL over One-Counter Automata , 2008, FoSSaCS.

[11]  Jean Goubault-Larrecq,et al.  Forward Analysis for WSTS, Part II: Complete WSTS , 2009, ICALP.

[12]  Petr Jancar,et al.  Decidability of Bisimilarity for One-Counter Processes , 2000, Inf. Comput..

[13]  W. Marsden.  I and J , 2012 .

[14]  YannakakisMihalis,et al.  Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems , 2010 .

[15]  James L. Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[16]  Joël Ouaknine,et al.  Reachability in Succinct and Parametric One-Counter Automata , 2009, CONCUR.

[17]  Markus Holzer.  On Emptiness and Counting for Alternating Finite Automata , 1995, Developments in Language Theory.

[18]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[19]  Jean Goubault-Larrecq,et al.  Karp-Miller Trees for a Branching Extension of VASS , 2005, Discret. Math. Theor. Comput. Sci..

[20]  Kousha Etessami,et al.  Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[21]  Faron Moller,et al.  DP lower bounds for equivalence-checking and model-checking of one-counter automata , 2004, Inf. Comput..

[22]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[23]  Petr Jan.  Simulation and Bisimulation over One-Counter Processes , 1999 .

[24]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[25]  Parosh Aziz Abdulla,et al.  Monotonic and Downward Closed Games , 2008, J. Log. Comput..

[26]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[27]  Antonín Kucera,et al.  Equivalence-checking on infinite-state systems: Techniques and results , 2002, Theory and Practice of Logic Programming.

[28]  Antonín Kucera,et al.  The complexity of bisimilarity-checking for one-counter processes , 2003, Theor. Comput. Sci..

[29]  Jean Goubault-Larrecq,et al.  Forward analysis for WSTS, part I: completions , 2009, Mathematical Structures in Computer Science.

[30]  Javier Esparza,et al.  Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[31]  Wolfgang Thomas,et al.  Infinite Games and Verification (Extended Abstract of a Tutorial) , 2002, CAV.

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

[33]  Petr Jancar,et al.  A note on emptiness for alternating finite automata with a one-letter alphabet , 2007, Inf. Process. Lett..

[34]  I. Borosh,et al.  Bounds on positive integral solutions of linear Diophantine equations , 1976 .

[35]  Olivier Serre,et al.  Parity Games Played on Transition Graphs of One-Counter Processes , 2006, FoSSaCS.

[36]  Petr Jancar.  Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

[37]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

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