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

From MaRDI portal
Revision as of 04:38, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    Continuous-time
    0 references
    Markov decision process
    0 references
    Temporal logic
    0 references
    Model checking
    0 references
    Time-bounded reachability
    0 references

    Identifiers