Pages that link to "Item:Q418128"
From MaRDI portal
The following pages link to The complexity of stochastic Müller games (Q418128):
Displaying 10 items.
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- On the Complexity of Non-reversible Betting Games on Many-Valued Events (Q3163975) (← links)
- Explicit Muller Games are PTIME (Q3165962) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- (Q4986513) (← links)
- Stochastic Müller Games are PSPACE-Complete (Q5458855) (← links)
- Automata, Languages and Programming (Q5716836) (← links)
- (Q6134270) (← links)