Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Deciding bisimilarity and similarity for probabilistic processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative branching-time semantics for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Refinement Relations and Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bisimulation is sound and complete for pCTL\(^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logical characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulations Meet PCTL Equivalences for Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank

Latest revision as of 11:02, 4 July 2024

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

    Identifiers

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