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

Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences, Branching Bisimulation Congruence for Probabilistic Systems, 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, Cones and foci: A mechanical framework for protocol verification, Essential transitions to bisimulation equivalences, Distinguishing and relating higher-order and first-order processes by expressiveness, Rooted branching bisimulation as a congruence, Operational semantics for Petri net components, 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