Markov decision processes and regular events
Proceedings of the seventeenth international colloquium on Automata, languages and programming
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
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Competitive Markov decision processes
Competitive Markov decision processes
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
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
On the complexity of solving Markov decision problems
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
Reduction of stochastic parity to stochastic mean-payoff games
Information Processing Letters
Games, Time, and Probability: Graph Models for System Design and Analysis
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
25 Years of Model Checking
Games through Nested Fixpoints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Survey of Stochastic Games with Limsup and Liminf Objectives
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Regularity in PDA Games Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
The Complexity of Solving Stochastic Games on Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A Novel Stochastic Game Via the Quantitative μ-calculus
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
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Information and Computation
Decision problems for Nash equilibria in stochastic games
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Solving simple stochastic tail games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Qualitative reachability in stochastic BPA games
Information and Computation
Symbolic algorithms for qualitative analysis of Markov decision processes with Buchi objectives
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Strategy improvement and randomized subexponential algorithms for stochastic parity games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The complexity of stochastic rabin and streett games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of stochastic Müller games
Information and Computation
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Gist: a solver for probabilistic games
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A game based model of security for key predistribution schemes in wireless sensor network
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Simulation-Based graph similarity
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
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
Robustness of structurally equivalent concurrent parity games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
Strategy synthesis for markov decision processes and branching-time logics
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Perfect information stochastic priority games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Towards communication-based steering of complex distributed systems
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Formal Methods in System Design
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Faster algorithms for markov decision processes with low treewidth
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A survey of partial-observation stochastic parity games
Formal Methods in System Design
Hi-index | 0.00 |
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play results in an infinite path and the conflicting goals of the two players are ω-regular path properties, formalized as parity winning conditions. The qualitative solution of such a game amounts to computing the set of vertices from which a player has a strategy to win with probability 1 (or with positive probability). The quantitative solution amounts to computing the value of the game in every vertex, i.e., the highest probability with which a player can guarantee satisfaction of his own objective in a play that starts from the vertex.For the important special case of one-player stochastic parity games (parity Markov decision processes) we give polynomial-time algorithms both for the qualitative and the quantitative solution. The running time of the qualitative solution is O(d · m3/2) for graphs with m edges and d priorities. The quantitative solution is based on a linear-programming formulation.For the two-player case, we establish the existence of optimal pure memoryless strategies. This has several important ramifications. First, it implies that the values of the games are rational. This is in contrast to the concurrent stochastic parity games of de Alfaro et al.; there, values are in general algebraic numbers, optimal strategies do not exist, and ε-optimal strategies have to be mixed and with infinite memory. Second, the existence of optimal pure memoryless strategies together with the polynomial-time solution forone-player case implies that the quantitative two-player stochastic parity game problem is in NP ∩ co-NP. This generalizes a result of Condon for stochastic games with reachability objectives. It also constitutes an exponential improvement over the best previous algorithm, which is based on a doubly exponential procedure of de Alfaro and Majumdar for concurrent stochastic parity games and provides only ε-approximations of the values.