Pages that link to "Item:Q3581549"
From MaRDI portal
The following pages link to The complexity of quantitative concurrent parity games (Q3581549):
Displayed 12 items.
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Concurrent games with tail objectives (Q2464942) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Value Iteration (Q3512436) (← links)
- On Omega-Languages Defined by Mean-Payoff Conditions (Q3617739) (← links)
- Subgame optimal strategies in finite concurrent games with prefix-independent objectives (Q6091217) (← links)