Raiders of the lost equivalence: probabilistic branching bisimilarity

DOI10.1016/j.ipl.2020.105947zbMath1441.68145OpenAlexW3013492721MaRDI QIDQ783681

Simone Tini, Valentina Castiglioni

Publication date: 4 August 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.105947

zbMATH Keywords

equivalence relationsformal semanticsnondeterministic probabilistic processesprobabilistic branching bisimilaritysemi-branching bisimilarity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Model independent approach to probabilistic models ⋮ Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Back to the format: a survey on SOS for probabilistic processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
• Polynomial time decision algorithms for probabilistic automata
• Confluence reduction for Markov automata
• Branching bisimulation congruence for probabilistic systems
• A calculus of communicating systems
• A logic for reasoning about time and reliability
• Branching bisimilarity is an equivalence indeed!
• Branching time and orthogonal bisimulation equivalence
• A process algebra for timed systems
• Reactive, generative, and stratified models of probabilistic processes
• Exploring probabilistic bisimulations. I
• Rooted branching bisimulation as a congruence
• Probabilistic divide \& congruence: branching bisimilarity
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Characterising Testing Preorders for Finite Probabilistic Processes
• Formal verification of parallel programs
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• Characterising Probabilistic Processes Logically
• A Specification Format for Rooted Branching Bisimulation
• An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

This page was built for publication: Raiders of the lost equivalence: probabilistic branching bisimilarity