We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP \mathalphae with bounded communication can be expressed as the parallel composition of a multiset of weakly normed parallel prime processes in exactly one way.
|Title of host publication||Mathematical Foundations of Computer Science (Proceedings 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003)|
|Editors||B. Rovan, P. Vojtás|
|Place of Publication||Berlin|
|Publication status||Published - 2003|
|Name||Lecture Notes in Computer Science|