On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of stochastic games
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Finitely additive stochastic games with Borel measurable payoffs
International Journal of Game Theory
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Concurrent games with tail objectives
Theoretical Computer Science
Qualitative Concurrent Stochastic Games with Imperfect Information
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Qualitative Determinacy and Decidability of Stochastic Games with Signals
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
New Algorithms for Solving Simple Stochastic Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal strategy synthesis in stochastic Müller games
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Pure stationary optimal strategies in Markov decision processes
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The complexity of stochastic rabin and streett games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Strategy improvement for stochastic rabin and streett games
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Approximating the termination value of one-counter MDPs and stochastic games
Information and Computation
Determinacy and optimal strategies in infinite-state stochastic reachability games
Theoretical Computer Science
| Hi-index | 0.00 |
Infinite stochastic games are a natural model for open reactive processes: one player represents the controller and the other represents a hostile environment. The evolution of the system depends on the decisions of the players, supplemented by chance. There are two main algorithmic problems on such games: computing the values of the vertices (quantitative analysis) and deciding whether a player can win with probability one, or arbitrarily close to one (qualitative analysis). In this paper, we reduce the quantitative analysis of simple stochastic tail games (where both players have perfect information and the winner does not depend on finite prefixes) to the qualitative analysis: we provide an algorithm computing values which uses qualitative analysis sub-procedure. The correctness proof of this algorithm reveals several nice properties of perfect-information stochastic tail games, in particular the existence of optimal strategies. We apply these results to games whose winning conditions are boolean combinations of mean-payoff and Büchi conditions.