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

DOI10.1016/j.tcs.2012.10.001zbMath1261.90087OpenAlexW1991629437MaRDI QIDQ1935779

Markus N. 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

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

Related Items (4)

Quantitative verification and strategy synthesis for stochastic games ⋮ A uniformization-based algorithm for continuous-time stochastic games model checking ⋮ Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games ⋮ Efficient approximation of optimal control for continuous-time Markov games

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