Branching bisimilarity is an equivalence indeed!

DOI10.1016/0020-0190(96)00034-8zbMath0875.68624OpenAlexW2160548641MaRDI QIDQ1350620

Twan Basten

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00034-8

zbMATH Keywords

Concurrency theoryFormal semanticsBranching bisimilarity

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (30)

Model independent approach to probabilistic models ⋮ Operational semantics for Petri net components ⋮ Cones and foci: A mechanical framework for protocol verification ⋮ Parity game reductions ⋮ Unnamed Item ⋮ A complete axiomatization of weighted branching bisimulation ⋮ Essential transitions to bisimulation equivalences ⋮ Axiomatizing flat iteration ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof ⋮ Theory of interaction ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity ⋮ Team equivalences for finite-state machines with silent moves ⋮ Expressiveness of component-based frameworks: a study of the expressiveness of BIP ⋮ Rooted branching bisimulation as a congruence ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ On cool congruence formats for weak bisimulations ⋮ Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences ⋮ Inheritance of behavior ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ Inheritance of workflows: An approach to tackling problems related to change ⋮ Thread algebra for noninterference ⋮ Branching Bisimulation Games ⋮ Divide and congruence III: Stability & divergence ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ Unnamed Item ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves

Cites Work

• Unnamed Item
• Unnamed Item
• Structural operational semantics for weak bisimulations
• A calculus of communicating systems
• \(\tau\)-bisimulations and full abstraction for refinement of actions
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/September 1993. Proceedings
• Process Algebra
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Branching bisimilarity is an equivalence indeed!