Optimal Time-Abstract Schedulers for CTMDPs and Markov Games
نویسندگان
چکیده
منابع مشابه
Optimal Time-Abstract Schedulers for CTMDPs and Markov Games
We study time-bounded reachability in continuous-time Markov decision processes for time-abstract scheduler classes. Such reachability problems play a paramount rôle in dependability analysis and the modelling of manufacturing and queueing systems. Consequently, their analysis has been studied intensively, and techniques for the approximation of optimal control are well understood. From a mathe...
متن کاملEfficient Approximation of Optimal Control for Continuous-Time Markov Games
We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretisation techniques to break time into discrete intervals of size ε, and optimal control is approximated for each interval separately. Current techniques provide an accuracy of O(ε2) on each interval, which leads to an infeasibly...
متن کاملReachability in continuous-time Markov reward decision processes
Continuous-time Markov decision processes (CTMDPs) are widely used for the control of queueing systems, epidemic and manufacturing processes. Various results on optimal schedulers for discounted and average reward optimality criteria in CTMDPs are known, but the typical game-theoretic winning objectives have received scant attention so far. This paper studies various sorts of reachability objec...
متن کاملPlaying Optimally on Timed Automata with Random Delays
We marry continuous time Markov decision processes (CTMDPs) with stochastic timed automata into a model with joint expressive power. This extension is very natural, as the two original models already share exponentially distributed sojourn times in locations. It enriches CTMDPs with timing constraints, or symmetrically, stochastic timed automata with one conscious player. Our model maintains th...
متن کاملDelayed Nondeterminism in Continuous-Time Markov Decision Processes
Schedulers in randomly timed games can be classified as to whether they use timing information or not. We consider continuous-time Markov decision processes (CTMDPs) and define a hierarchy of positional (P) and historydependent (H) schedulers which induce strictly tighter bounds on quantitative properties on CTMDPs. This classification into time abstract (TA), total time (TT) and fully time-dep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.28.10