Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q5299841)

From MaRDI portal
Revision as of 01:36, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q764615)
scientific article; zbMATH DE number 6179921
Language Label Description Also known as
English
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
scientific article; zbMATH DE number 6179921

    Statements

    Bisimulations Meet PCTL Equivalences for Probabilistic Automata (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    probabilistic computation tree logic
    0 references
    PCTL
    0 references
    probabilistic automata
    0 references
    characterization
    0 references
    bisimulation
    0 references
    behavioral equivalence
    0 references

    Identifiers

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