Sciweavers

Share
TCS
2016

Unique parallel decomposition in branching and weak bisimulation semantics

3 years 6 months ago
Unique parallel decomposition in branching and weak bisimulation semantics
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally 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.
Bas Luttik
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCS
Authors Bas Luttik
Comments (0)
books