Publication:5501249
From MaRDI portal
zbMath1318.91027MaRDI QIDQ5501249
Marcin Jurdziński, Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 3 August 2015
68Q25: Analysis of algorithms and problem complexity
91A05: 2-person games
91A43: Games involving graphs
68R10: Graph theory (including graph drawing) in computer science
91A15: Stochastic games, stochastic differential games
68W25: Approximation algorithms
Related Items
Monadic Second Order Logic with Measure and Category Quantifiers, Unnamed Item, Unnamed Item, Deciding Parity Games in Quasi-polynomial Time, Regularity in PDA Games Revisited, Model-Free Reinforcement Learning for Stochastic Parity Games, Model-Checking ω-Regular Properties of Interval Markov Chains, Measuring and Synthesizing Systems in Probabilistic Environments, Unnamed Item, Unnamed Item, Quantitative verification and strategy synthesis for stochastic games, On canonical forms for zero-sum stochastic mean payoff games, A survey of stochastic \(\omega \)-regular games, The complexity of stochastic Müller games, Probabilistic opacity for Markov decision processes, Qualitative reachability in stochastic BPA games, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Randomness for free, Reduction of stochastic parity to stochastic mean-payoff games, Strategy logic, Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games, Latticed-LTL synthesis in the presence of noisy inputs, A convex programming-based algorithm for mean payoff stochastic games with perfect information, Improving parity games in practice, Simple stochastic games with almost-sure energy-parity objectives are in NP and conp, Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives, Automatic verification of competitive stochastic systems, A survey of partial-observation stochastic parity games, Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives, A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions, Concurrent reachability games, Solving Parity Games Using an Automata-Based Algorithm, Randomization in Automata on Infinite Trees, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, Graph Games and Reactive Synthesis, Model Checking Probabilistic Systems, Stochastic Games with Finitary Objectives, Measuring Permissivity in Finite Games, Probabilistic Weighted Automata, Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition, The Complexity of Synthesis from Probabilistic Components, Value Iteration, Decision Problems for Nash Equilibria in Stochastic Games
