Decomposition orders -- another generalisation of the fundamental theorem of arithmetic

DOI10.1016/j.tcs.2004.11.019zbMath1085.06009OpenAlexW2119820724MaRDI QIDQ1781996

Bas Luttik, Vincent van Oostrom

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.019

zbMATH Keywords

Process algebraCommutative residual algebraDecomposition orderFundamental theorem of arithmeticPartial commutative monoidUnique decomposition

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Ordered semigroups and monoids (06F05) Partial algebras (08A55)

Related Items (5)

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus ⋮ Unnamed Item ⋮ Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences

Cites Work

• Unique decomposition of processes
• The algebra of communicating processes with empty process
• Towards action-refinement in process algebras
• Process algebra for synchronous communication
• The Riesz decomposition property for the space of regular operators
• Mathematical Foundations of Computer Science 2003
• Free Sums of Groups and Their Generalizations. An Analysis of the Associative Law
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition orders -- another generalisation of the fundamental theorem of arithmetic