Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of stochastic games
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Church synthesis problem for noisy input
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Efficient analysis of probabilistic programs with an unbounded counter
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On memoryless quantitative objectives
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
From boolean to quantitative synthesis
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Minimizing expected termination time in one-counter markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative timed simulation functions and refinement metrics for real-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Optimal bounds for multiweighted and parametrised energy games
Theories of Programming and Formal Methods
Hi-index | 0.00 |
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 sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ 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, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.