Optimal time-abstract Schedulers for CTMDPs and Markov Games

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 28, Issue , 2010, Pages 144-158

  Rabe, Markus ^a   Schewe, Sven ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES;

CONTINUOUS TIME MARKOV DECISION PROCESS; DEPENDABILITY ANALYSIS; GENERAL STRUCTURES; OPTIMAL SCHEDULER; OPTIMAL STRATEGIES; REACHABILITY PROBLEM; SCHEDULING POLICIES; TIME-BOUNDED REACHABILITY;

SCHEDULING;

EID: 84961845101     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.28.10     Document Type: Conference Paper

References (18)

1. Adnan Aziz, Kumud Sanwal, Vigyan Singhal, and Robert Bray ton. Model-checking continuous-time Markov chains. Transactions on Computational Logic, 1(1): 162-170, 2000.
2. Christel Baier, Holger Hermanns, Joost-Pieter Katoen, and Boudewijn R. Haverkort. Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theoretical Computer Science, 345(1):2-26,2005.
3. Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera. Continuous-time stochastic games with time-bounded reachability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), pages 61-72, 2009.
4. J. Bruno, P. Downey, and G. N. Frederickson. Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. Journal of the ACM, 28(1): 100-113,1981.
5. Eugene A. Feinberg. Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach. Mathematics of Operations Research, 29(3):492-524, 2004.
6. Jerzy Filar and Koos Vrieze. Competitive Markov decision processes. Springer-Verlag New York, Inc., New York, NY, USA, 1996.
7. H. Hermanns. Interactive Markov Chains and the Quest for Quantified Quality. LNCS 2428. Springer-Verlag, 2002.
8. Vidyadhar G. Kulkarni. Modeling and Analysis of Stochastic Systems. Chapman & Hall, Ltd., London, UK, 1995.
9. M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. SIGMETRICS Performance Evaluation Review, 26(2):2, 1998.
10. Martin R. Neuhäußer, Mariëlle Stoelinga, and Joost-Pieter Katoen. Delayed Nondeterminism in Continuous-Time Markov Decision Processes. In Proceedings of FOSSACS '09, pages 364-379, 2009.
11. Martin R. Neuhäußer and Lijun Zhang. Time-Bounded Reachability in Continuous-Time Markov Decision Processes. Technical report, 2009.
12. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley-Interscience, April 1994.
13. Markus Rabe. Optimal Schedulers for Time-Bounded Reachability in CTMDPs. Master's thesis, Saarbrücken Graduate School of Computer Science, Saarbrücken, Germany, September 2009.
14. Markus Rabe and Sven Schewe. Optimal Schedulers for Time-Bounded Reachability in CTMDPs. Reports of SFB/TR 14 AVACS 55, SFB/TR 14 AVACS, October 2009. http://www.avacs.org.
15. William H. Sanders and John F. Meyer. Reduced Base Model Construction Methods for Stochastic Activity Networks. In Proceedings of PNPM'89, pages 74-84, 1989.
16. Linn I. Sennott. Stochastic Dynamic Programming and the Control of Queueing Systems. Wiley-Interscience, 1999.
17. Nicolás Wolovick and Sven Johr. A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes. In Proceedings of FORMATS'06, pages 352-367, 2006.
18. L. Zhang, H. Hermanns, E. M. Hahn, and B. Wachter. Time-bounded model checking of infinite-state continuous-time Markov chains. In Proceedings of ACSD'08, pages 98-107, 2008.