The complexity of reachability in parametric Markov decision processes (Q2662678)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of reachability in parametric Markov decision processes
scientific article

    Statements

    The complexity of reachability in parametric Markov decision processes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 April 2021
    0 references
    parametric Markov decision processes
    0 references
    formal verification
    0 references
    existential theory of the reals
    0 references
    computational complexity
    0 references
    parameter synthesis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references