The following pages link to (Q5501249):
Displayed 43 items.
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Randomness for free (Q897644) (← links)
- Reduction of stochastic parity to stochastic mean-payoff games (Q963321) (← links)
- Strategy logic (Q979080) (← links)
- Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games (Q1627843) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
- Automatic verification of competitive stochastic systems (Q2248068) (← links)
- A survey of partial-observation stochastic parity games (Q2248075) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Randomization in Automata on Infinite Trees (Q2946733) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Stochastic Games with Finitary Objectives (Q3182912) (← links)
- Measuring Permissivity in Finite Games (Q3184674) (← links)
- Probabilistic Weighted Automata (Q3184677) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- The Complexity of Synthesis from Probabilistic Components (Q3449469) (← links)
- Value Iteration (Q3512436) (← links)
- Decision Problems for Nash Equilibria in Stochastic Games (Q3644770) (← links)
- Monadic Second Order Logic with Measure and Category Quantifiers (Q4637695) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Model-Free Reinforcement Learning for Stochastic Parity Games (Q5089286) (← links)
- (Q5092320) (← links)
- (Q5141616) (← links)
- Regularity in PDA Games Revisited (Q5170272) (← links)
- Model-Checking ω-Regular Properties of Interval Markov Chains (Q5458367) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- (Q5743484) (← links)
- (Q5875369) (← links)