Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Cyclical games with prohibitions
Mathematical Programming: Series A and B
The complexity of mean payoff games on graphs
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Mathematics of Operations Research
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
How to solve large scale deterministic games with mean payoff by policy iteration
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
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
From Parity and Payoff Games to Linear Programming
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Theoretical Computer Science
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
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
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control
The complexity of infinitely repeated alternating move games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff algorithms. Our algorithm can also be combined with the procedure by Andersson and Vorobyov to obtain a randomized algorithm with currently the best expected time complexity. The proposed solution relies on a simple fixpoint iteration to solve the log-space equivalent problem of deciding the winner of energy games. Our results imply also that energy games and mean-payoff games can be reduced to safety games in pseudopolynomial time.