Arrow Research search
Back to TCS

TCS 2016

Unique parallel decomposition in branching and weak bisimulation semantics

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that normed behaviours always have parallel decompositions, but that these are not necessarily unique. Then, we establish that finite behaviours have unique parallel decompositions. We derive the latter result from a general theorem about unique decompositions in partial commutative monoids.

Authors

Keywords

  • Unique parallel decomposition
  • Branching bisimilarity
  • Weak bisimilarity
  • Process calculus

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
79363376288263748
v2026.09.13