A unique decomposition theorem for ordered monoids with applications in process theory

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science (Proceedings 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003)
EditorsB. Rovan, P. Vojtás
Place of PublicationBerlin
PublisherSpringer
Pages562-571
ISBN (Print)3-540-40671-9
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science
Volume2747
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'A unique decomposition theorem for ordered monoids with applications in process theory'. Together they form a unique fingerprint.

Cite this