Infinite-state energy games

Energy games are a well-studied class of 2-player turn-based games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy). One player tries to keep the cumulative changes non-negative in every component while the other tries to frustrate this. We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of one-counter automata. Our main result is that energy games are decidable in the case where the game graph is induced by a one-counter automaton and the energy is one-dimensional. On the other hand, every further generalization is undecidable: Energy games on one-counter automata with a 2-dimensional energy are undecidable, and energy games on pushdown automata are undecidable even if the energy is one-dimensional. Furthermore, we show that energy games and simulation games are inter-reducible, and thus we additionally obtain several new (un)decidability results for the problem of checking simulation preorder between pushdown automata and vector addition systems.

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

[2]  Anthony Widjaja Lin,et al.  On the Computational Complexity of Verifying One-Counter Processes , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[3]  Krishnendu Chatterjee,et al.  Energy Parity Games , 2010, ICALP.

[4]  Faron Moller,et al.  Simulation Problems for One-Counter Machines , 1999, SOFSEM.

[5]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

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

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

[8]  Slawomir Lasota,et al.  Simulation Over One-counter Nets is PSPACE-Complete , 2013, FSTTCS.

[9]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

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

[11]  Orna Kupferman,et al.  What's Decidable about Weighted Automata? , 2011, ATVA.

[12]  Igor Walukiewicz.  Model Checking CTL Properties of Pushdown Systems , 2000, FSTTCS.

[13]  Parosh Aziz Abdulla,et al.  Solving Parity Games on Integer Vectors , 2013, CONCUR.

[14]  Tomás Brázdil,et al.  Reachability Games on Extended Vector Addition Systems with States , 2010, ICALP.

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

[16]  Krishnendu Chatterjee,et al.  Generalized Mean-payoff and Energy Games , 2010, FSTTCS.

[17]  Colin Stirling,et al.  Bisimulation, Modal Logic and Model Checking Games , 1999, Logic Journal of the IGPL.

[18]  Krishnendu Chatterjee,et al.  Strategy synthesis for multi-dimensional quantitative objectives , 2012, Acta Informatica.

[19]  Krishnendu Chatterjee,et al.  Mean-Payoff Pushdown Games , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[20]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .