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.
|Name||Lecture Notes in Computer Science|
|Conference||7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science; 2012-09-26; 2012-09-28|
|Period||26/09/12 → 28/09/12|
|Other||7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science|