A characterization of meaningful schedulers for continuous-time Markov decision processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4202 LNCS, Issue , 2006, Pages 352-367

  Wolovick, Nicolás ^a   Johr, Sven ^b  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DECISION MAKING; DECISION THEORY; PROBABILISTIC LOGICS; SCHEDULING; STOCHASTIC CONTROL SYSTEMS;

FIRE-TIME DISTRIBUTIONS; INFINITE PATHS; MARKOV DECISION PROCESSES; PROBABILITY MEASURE;

MARKOV PROCESSES;

EID: 33750360711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11867340_25     Document Type: Conference Paper

References (20)

1. Bertsekas, D.P.: Dynamic Programming and Optimal Control. Volume II. Athena Scientific (1995)
2. Feinberg, E.A.: Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach. Mathematics of Operations Research 29 (2004) 492-524
3. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley (1994)
4. Sennot, L.: Stochastic Dynamic Programming and the Control of Queueing Systems. John Wiley & Sons (1999)
5. Abdeddaïm, Y., Asarin, E., Maler, O.: On Optimal Scheduling under Uncertainty. TACAS (2003) 240-253
6. Bruno, J., Downey, P., Frederickson, G.N.: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. J. ACM 28 (1981) 100-113
7. Qiu, Q., Pedram., M.: Dynamic power managment based on continuous-time Markov decision processes. In: Proceedings DAC. (1999) 555 - 561
8. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time markov decision processes. In: TACAS: International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, LNCS. (2004)
9. Cattani, S., Segala, R., Kwiatkowska, M.Z., Norman, G.: Stochastic Transition Systems for Continuous State Spaces and Non-determinism. In: FoSSaCS. (2005) 125-139
10. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Verifying quantitative properties of continuous probabilistic timed automata. In Palamidessi, C., ed.: Proc. CONCUR 2000 - Concurrency Theory. Volume 1877 of Lecture Notes in Computer Science., Springer (2000) 123-137
11. O.Hernndez-Lerma, Lassere, J.B.: Discrete-time Markov control processes: Basic optimality criteria. Volume 30 of Appl. Math. Springer-Verlag, Berlin and New York (1996)
12. K.Grabiszewski: Type space with disintegrability. Draft (2005)
13. Valadier, M.: Désintégration d'une mesure sur un produit. C.R. Acad. Sc. Paris 276 (1973) 33-35 Serie A.
14. Ash, R.B., Doléans-Dade, C.A.: Probability & Measure Theory, second edn. Academic Press (2000)
15. Shiryaev, A.N.: Probability, second edn. Springer (1995)
16. Panangaden, P.: Measure and probability for concurrency theorists. TCS: Theoretical Computer Science 253 (2001)
17. Panangaden, P.: Stochastic Techniques in Concurrency. Unpublished Lecture Notes from a course given at BRICS (1997)
18. Billingsley, P.: Probability and Measure. Wiley, New York, NY (1986) Second Edition.
19. Jr., D.L., Fragoso, M., Ruffino, P.: Regular conditional probability, disintegration of probability and radon spaces. Proyecciones 23 (2004) 15-29
20. Edalat, A.: Semi-pullbacks and bisimulation in categories of markov processes. Mathematical Structures in Computer Science 9 (1999) 523-543