Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825)

From MaRDI portal
Revision as of 10:38, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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