Pages that link to "Item:Q924718"
From MaRDI portal
The following pages link to Reachability in recursive Markov decision processes (Q924718):
Displaying 11 items.
- Determinacy and optimal strategies in infinite-state stochastic reachability games (Q391114) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- (Q5091277) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- Regularity in PDA Games Revisited (Q5170272) (← links)
- Bounded Verification of Reachability of Probabilistic Hybrid Systems (Q6104812) (← links)
