Pages that link to "Item:Q1935779"
From MaRDI portal
The following pages link to Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games (Q1935779):
Displaying 10 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
- Stochastic scheduling games with Markov decision arrival processes (Q1312000) (← links)
- An integrative approach with sequential game to real-time gate assignment under CDM mechanism (Q1717750) (← links)
- A uniformization-based algorithm for continuous-time stochastic games model checking (Q1757155) (← links)
- Continuous-time stochastic games with time-bounded reachability (Q1951600) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- Efficient approximation of optimal control for continuous-time Markov games (Q2911641) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308389) (← links)