Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825)

From MaRDI portal
Revision as of 11:02, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
scientific article

    Statements

    Bisimulations Meet PCTL Equivalences for Probabilistic Automata (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references