Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Branching bisimulation congruence for probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching bisimulation for probabilistic systems: characteristics and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching bisimilarity is an equivalence indeed! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and orthogonal bisimulation equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Specification Format for Rooted Branching Bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic divide \& congruence: branching bisimilarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three logics for branching bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising Probabilistic Processes Logically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising Testing Preorders for Finite Probabilistic Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted branching bisimulation as a congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive, generative, and stratified models of probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038723 / 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: Exploring probabilistic bisimulations. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A process algebra for timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence reduction for Markov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time decision algorithms for probabilistic automata / rank
 
Normal rank

Latest revision as of 05:04, 23 July 2024

scientific article
Language Label Description Also known as
English
Raiders of the lost equivalence: probabilistic branching bisimilarity
scientific article

    Statements

    Raiders of the lost equivalence: probabilistic branching bisimilarity (English)
    0 references
    0 references
    0 references
    4 August 2020
    0 references
    formal semantics
    0 references
    nondeterministic probabilistic processes
    0 references
    probabilistic branching bisimilarity
    0 references
    semi-branching bisimilarity
    0 references
    equivalence relations
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers