Pages that link to "Item:Q5410676"
From MaRDI portal
The following pages link to The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (Q5410676):
Displaying 8 items.
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Deciding Maxmin Reachability in Half-Blind Stochastic Games (Q2819447) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- The Complexity of Synthesis from Probabilistic Components (Q3449469) (← links)
- Partial-Observation Stochastic Games (Q5169972) (← links)
