On the complexity of model checking interval-valued discrete time Markov chains (Q1943636)

From MaRDI portal
Revision as of 22:50, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of model checking interval-valued discrete time Markov chains
scientific article

    Statements

    On the complexity of model checking interval-valued discrete time Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    20 March 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    formal methods
    0 references
    discrete time Markov chain
    0 references
    reachability
    0 references
    PCTL
    0 references
    complexity
    0 references
    linear programming
    0 references
    0 references