Decomposition orders: another generalisation of the fundamental theorem of arithmetic

Authors:
Bas Luttik;Vincent van Oostrom
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands and CWI, P.O. Box 94079, NL-1090 GB Amsterdam, The Netherlan ...;Department of Philosophy, Utrecht University, Heidelberglaan 8, NL-3584 CS Utrecht, The Netherlands
Venue:
Theoretical Computer Science - Process algebra
Year:
2005

Citing 9
Cited 6

Merge and termination in process algebra

Proc. of the seventh conference on Foundations of software technology and theoretical computer science
The importance of the left merge operator in process algebras

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Unique decomposition of processes

Theoretical Computer Science
Towards action-refinement in process algebras

Information and Computation
The algebra of communicating processes with empty process

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Communication and Concurrency

Communication and Concurrency
Verification of Parallel Systems via Decomposition

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Fully Abstract Relational Model of Syntactic Control of Interference

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic

A finite equational base for CCS with left merge and communication merge

ACM Transactions on Computational Logic (TOCL)
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences

Electronic Notes in Theoretical Computer Science (ENTCS)
A geometric approach to the problem of unique decomposition of processes

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A finite equational base for CCS with left merge and communication merge

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Unique parallel decomposition in branching and weak bisimulation semantics

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On unique decomposition of processes in the applied π-calculus

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss unique decomposition in partial commutative monoids. Inspired by a result from process theory, we propose the notion of decomposition order for partial commutative monoids, and prove that a partial commutative monoid has unique decomposition iff it can be endowed with a decomposition order. We apply our result to establish that the commutative monoid of weakly normed processes modulo bisimulation definable in ACPε with linear communication, with parallel composition as binary operation, has unique decomposition. We also apply our result to establish that the partial commutative monoid associated with a well-founded commutative residual algebra has unique decomposition.