Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games

DOI10.1016/J.TCS.2012.10.001MaRDI QIDQ1935779zbMATH OpenOpenAlexFDO

Authors Markus Rabe, Sven Schewe

Publication date 19 February 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.10.001

zbMATH Keywords

optimal controlcontinuous-time Markov decision processescontinuous-time Markov gamestime-bounded reachability

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Optimal time-abstract schedulers for CTMDPs and Markov games
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
• Tools and Algorithms for the Construction and Analysis of Systems
• Playing optimally on timed automata with random delays
• Continuous-time stochastic games with time-bounded reachability

Cited in

(14)

• Stochastic scheduling games with Markov decision arrival processes
• Efficient approximation of optimal control for continuous-time Markov games
• Efficient approximation of optimal control for continuous-time Markov games
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
• A uniformization-based algorithm for continuous-time stochastic games model checking
• Maximal cost-bounded reachability probability on continuous-time Markov decision processes
• Continuous-time stochastic games with time-bounded reachability
• Quantitative verification and strategy synthesis for stochastic games
• Tools and Algorithms for the Construction and Analysis of Systems
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Optimal time-abstract schedulers for CTMDPs and Markov games
• Playing optimally on timed automata with random delays
• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• An integrative approach with sequential game to real-time gate assignment under CDM mechanism

This page was built for publication: Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935779)