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

DOI10.1016/J.TCS.2004.11.019zbMATH Open1085.06009OpenAlexW2119820724MaRDI QIDQ1781996FDOQ1781996

Authors: 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

Recommendations

• Mathematical Foundations of Computer Science 2003
• Unique parallel decomposition in branching and weak bisimulation semantics
• Unique parallel decomposition in branching and weak bisimulation semantics
• On unique decomposition of processes in the applied \(\pi\)-calculus
• On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus

zbMATH Keywords

Process algebraCommutative residual algebraDecomposition orderFundamental theorem of arithmeticPartial commutative monoidUnique decomposition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Process algebra for synchronous communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Free Sums of Groups and Their Generalizations. An Analysis of the Associative Law
• Title not available (Why is that?)
• Title not available (Why is that?)
• The algebra of communicating processes with empty process
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unique decomposition of processes
• Towards action-refinement in process algebras
• The Riesz decomposition property for the space of regular operators
• Mathematical Foundations of Computer Science 2003

Cited In (9)

• Mathematical Foundations of Computer Science 2003
• Normed processes, unique decomposition, and complexity of bisimulation equivalences
• A theorem on refining division orders by the reverse lexicographic order
• Unique parallel decomposition in branching and weak bisimulation semantics
• On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus
• Unique parallel decomposition in branching and weak bisimulation semantics
• On unique decomposition of processes in the applied \(\pi\)-calculus
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• Unique parallel decomposition for the \(\pi\)-calculus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781996)