Delayed Nondeterminism in Continuous-Time Markov Decision Processes


Share/Save/Bookmark

Neuhäußer, Martin R. and Stoelinga, Mariëlle and Katoen, Joost-Pieter (2009) Delayed Nondeterminism in Continuous-Time Markov Decision Processes. In: 12th International Conference Foundations of Software Science and Computational Structures, FOSSACS 2009, March 22-29, 2009, York, UK (pp. pp. 364-379).

[img] PDF
Restricted to UT campus only
: Request a copy
390kB
Abstract: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 history-dependent (H) schedulers which induce strictly tighter bounds on quantitative properties on CTMDPs. This classification into time abstract (TA), total time (TT) and fully time-dependent (T) schedulers is mainly based on the kind of timing details that the schedulers may exploit. We investigate when the resolution of nondeterminism may be deferred. In particular, we show that TTP and TAP schedulers allow for delaying nondeterminism for all measures, whereas this does neither hold for TP nor for any TAH scheduler. The core of our study is a transformation on CTMDPs which unifies the speed of outgoing transitions per state.
Item Type:Conference or Workshop Item
Copyright:© 2009 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/69312
Official URL:http://dx.doi.org/10.1007/978-3-642-00596-1_26
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page