Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes

Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Boudewijn R. Haverkort

    Research output: Contribution to journalArticleAcademicpeer-review

    96 Citations (Scopus)
    21 Downloads (Pure)

    Abstract

    A continuous-time Markov decision process (CTMDP) is a generalization of a continuous-time Markov chain in which both probabilistic and nondeterministic choices co-exist. This paper presents an efficient algorithm to compute the maximum (or minimum) probability to reach a set of goal states within a given time bound in a uniform CTMDP, i.e., a CTMDP in which the delay time distribution per state visit is the same for all states. It furthermore proves that these probabilities coincide for (time-abstract) history-dependent and Markovian schedulers that resolve nondeterminism either deterministically or in a randomized way.
    Original languageEnglish
    Pages (from-to)2-26
    Number of pages25
    JournalTheoretical computer science
    Volume345
    Issue number1
    DOIs
    Publication statusPublished - 2005

    Keywords

    • Continuous-time Markov decision process (CTMDP)
    • Temporal logic
    • Model checking
    • Time-bounded reachability

    Fingerprint Dive into the research topics of 'Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes'. Together they form a unique fingerprint.

    Cite this