Infinite-state energy games
From MaRDI portal
Publication:4635588
Abstract: 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.
Recommendations
Cited in
(9)- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- scientific article; zbMATH DE number 7559503 (Why is no real title available?)
- Long-Run Average Behavior of Vector Addition Systems with States
- Church synthesis on register automata over linearly ordered data domains
- Energy parity games
- Bounding Average-Energy Games
- Optimally Resilient Strategies in Pushdown Safety Games
- Energy mean-payoff games
- Fixed-dimensional energy games are in pseudo-polynomial time
This page was built for publication: Infinite-state energy games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635588)