 |
|
Baier, C. and Haverkort, B.R.H.M. and Hermanns, H. and Katoen, J.P.
(2008)
Reachability in continuous-time Markov reward decision processes.
In: Logic and Automata: History and Perspectives, 14-15 Dec 2007, Aachen, Germany.
.
Texts in Logic and Games 2.
Amsterdam University Press.
ISBN 978-90-5356-576-6
Full text available as:  AbstractContinuous-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 objectives for CTMDPs. Memoryless schedulers are optimal for simple reachability objectives as it suffices to consider the embedded MDP. Schedulers that may count the number of visits to states are optimal---when restricting to time-abstract schedulers---for timed reachability in uniform CTMDPs.
The central result is that for any CTMDP, reward reachability objectives are dual to timed ones.
As a corollary, epsilon-optimal schedulers for reward reachability objectives in uniform CTMDPs can be obtained in polynomial time using a simple backward greedy algorithm.
| Item Type: | Conference or Workshop Paper (Full Paper, Talk) |
|---|
| Research Group: | EWI-DACS: Design and Analysis of Communication Systems, EWI-FMT: Formal Methods and Tools |
|---|
| Research Program: | CTIT-DSN: Dependable Systems and Networks |
|---|
| Research Project: | Voss-2: Validation of Stochastic Systems II |
|---|
| ID Code: | 11634 |
|---|
| Status: | Published |
|---|
| Deposited On: | 08 January 2008 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item
|
|
|
Nederlands
Contact
Sitemap
Search
Organisation