Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Modal Mu-Calculus for Durational Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Games where you can play optimally without any memory
CONCUR 2005 - Concurrency Theory
Precise fixpoint computation through strategy iteration
ESOP'07 Proceedings of the 16th European conference on Programming
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A policy iteration algorithm for computing fixed points in static analysis of programs
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Games through Nested Fixpoints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Model checking the quantitative µ-calculus on linear hybrid systems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Hi-index | 0.00 |
We consider crash games which are a generalization of parity games in which the play value of a play is an integer, -∞ or ∞. In particular, the play value of a finite play is given as the sum of the payoffs of the moves of the play. Accordingly, one player aims at maximizing the play value whereas the other player aims at minimizing this value. We show that the game value of such a crash game at position v, i.e., the least upper bounds to the minimal play value that can be enforced by the maximum player in a play starting at v, can be characterized by a hierarchical system of simple integer equations. Moreover, we present a practical algorithm for solving such systems. The run-time of our algorithm (w.r.t. the uniform cost measure) is independent of the sizes of occurring numbers. Our method is based on a strategy improvement algorithm. The efficiency of our algorithm is comparable to the efficiency of the discrete strategy improvement algorithm developed by Vöge and Jurdzinski for the simpler Boolean case of parity games [19].