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

From MaRDI portal
Revision as of 20:24, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57801899, #quickstatements; #temporary_batch_1712201099914)
scientific article
Language Label Description Also known as
English
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
scientific article

    Statements

    Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2005
    0 references
    0 references
    Continuous-time
    0 references
    Markov decision process
    0 references
    Temporal logic
    0 references
    Model checking
    0 references
    Time-bounded reachability
    0 references
    0 references
    0 references