Branching bisimilarity is an equivalence indeed!

From MaRDI portal
Revision as of 14:06, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1350620

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




Related Items (30)

Model independent approach to probabilistic modelsOperational semantics for Petri net componentsCones and foci: A mechanical framework for protocol verificationParity game reductionsUnnamed ItemA complete axiomatization of weighted branching bisimulationEssential transitions to bisimulation equivalencesAxiomatizing flat iterationDistinguishing and relating higher-order and first-order processes by expressivenessRooted divergence-preserving branching bisimilarity is a congruence: a simpler proofTheory of interactionUnique parallel decomposition in branching and weak bisimulation semanticsDivide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarityTeam equivalences for finite-state machines with silent movesExpressiveness of component-based frameworks: a study of the expressiveness of BIPRooted branching bisimulation as a congruenceCausal Semantics for BPP Nets with Silent MovesBranching Bisimulation Congruence for Probabilistic SystemsProbabilistic divide \& congruence: branching bisimilarityOn cool congruence formats for weak bisimulationsNormed Processes, Unique Decomposition, and Complexity of Bisimulation EquivalencesInheritance of behaviorDivide and congruence. III: From decomposition of modal formulas to preservation of stability and divergenceInheritance of workflows: An approach to tackling problems related to changeThread algebra for noninterferenceBranching Bisimulation GamesDivide and congruence III: Stability & divergenceRaiders of the lost equivalence: probabilistic branching bisimilarityUnnamed ItemBranching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves



Cites Work




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