Branching bisimilarity is an equivalence indeed!

DOI10.1016/0020-0190(96)00034-8zbMath0875.68624MaRDI 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 theory; Formal semantics; Branching bisimilarity

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

Related Items

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

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