Energy Parity Games
arXiv:1001.5183
Abstract
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objective. Our main results are as follows: (a) exponential memory is necessary and sufficient for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP \cap coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is polynomially equivalent to the problem of deciding the winner in mean-payoff parity games, while optimal strategies may require infinite memory in mean-payoff parity games. As a consequence we obtain a conceptually simple algorithm to solve mean-payoff parity games.
Cited by in corpus (16)
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
- Parity and Streett Games with Costs
- Average-energy games
- Strategy Synthesis for Multi-dimensional Quantitative Objectives
- Minimizing Running Costs in Consumption Systems
- Quantitative Timed Simulation Functions and Refinement Metrics for Timed Systems (Full Version)
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter
- Faster Algorithms for Mean-Payoff Parity Games
- Comparator automata in quantitative verification
- Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version)
- Kleene Algebras and Semimodules for Energy Problems
- Optimal Strategy Synthesis for Request-Response Games
- Average-energy games (full version)
- Synthesis from LTL Specifications with Mean-Payoff Objectives
- On Memoryless Quantitative Objectives
- Optimizing the Expected Mean Payoff in Energy Markov Decision Processes