Reachability in continuous-time Markov reward decision processes
From MaRDI portal
Recommendations
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Tools and Algorithms for the Construction and Analysis of Systems
- scientific article; zbMATH DE number 1159486
- scientific article; zbMATH DE number 4059150
Cited in
(11)- Reachability and safety objectives in Markov decision processes on long but finite horizons
- Cost vs. time in stochastic games and Markov automata
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Quantitative controller synthesis for consumption Markov decision processes
- Efficient approximation of optimal control for continuous-time Markov games
- Optimal continuous time Markov decisions
- Tools and Algorithms for the Construction and Analysis of Systems
- Maximal cost-bounded reachability probability on continuous-time Markov decision processes
- State constrained reachability for stochastic hybrid systems
- PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP
- Enforcing almost-sure reachability in POMDPs
This page was built for publication: Reachability in continuous-time Markov reward decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086919)
