Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
From MaRDI portal
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 -calculus
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus
Cites work
- Free Sums of Groups and Their Generalizations. An Analysis of the Associative Law
- scientific article; zbMATH DE number 1670866 (Why is no real title available?)
- scientific article; zbMATH DE number 4037177 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177854 (Why is no real title available?)
- scientific article; zbMATH DE number 1309088 (Why is no real title available?)
- scientific article; zbMATH DE number 1948166 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 1405656 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- Process algebra for synchronous communication
- The algebra of communicating processes with empty process
- The Riesz decomposition property for the space of regular operators
- Towards action-refinement in process algebras
- Unique decomposition of processes
Cited in
(10)- A theorem on refining division orders by the reverse lexicographic order
- Unique parallel decomposition in branching and weak bisimulation semantics
- On unique decomposition of processes in the applied -calculus
- Unique parallel decomposition for the \(\pi\)-calculus
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
- Normed processes, unique decomposition, and complexity of bisimulation equivalences
- Mathematical Foundations of Computer Science 2003
- Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
- Unique parallel decomposition in branching and weak bisimulation semantics
- On the existence and decidability of unique decompositions of processes in the applied \(\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)