Journal of the ACM (JACM)
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Unique decomposition of processes
Theoretical Computer Science
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Communication and Concurrency
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Importance of the Left Merge Operator in Process Algebras
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Verification of Parallel Systems via Decomposition
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Decomposition orders: another generalisation of the fundamental theorem of arithmetic
Theoretical Computer Science - Process algebra
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
| Hi-index | 0.00 |
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally normed behaviours always have parallel decompositions, but that these are not necessarily unique. Then, we establish that finite behaviours have unique parallel decompositions. We derive the latter result from a general theorem about unique decompositions in partial commutative monoids.