Branching bisimilarity is an equivalence indeed!
type: Item
instance of: scholarly article
title: Branching bisimilarity is an equivalence indeed!
zbMATH Open document ID: 0875.68624
DOI: 10.1016/0020-0190(96)00034-8
author: T. Basten
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 984087
zbMATH Keywords: Formal semantics
zbMATH Keywords: Concurrency theory
zbMATH Keywords: Branching bisimilarity
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00034-8
OpenAlex ID: W2160548641
cites work: Process Algebra
cites work: Structural operational semantics for weak bisimulations
cites work: \(\tau\)-bisimulations and full abstraction for refinement of actions
cites work: Q5750408
cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
cites work: Three logics for branching bisimulation
cites work: Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/September 1993. Proceedings
cites work: Branching time and abstraction in bisimulation semantics
cites work: A calculus of communicating systems
cites work: Q4733394
description: scientific article; zbMATH DE number 984087