Unique decomposition of processes
Theoretical Computer Science
A calculus of mobile processes, I
Information and Computation
Information and Computation
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
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 randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 0.00 |
Unique decomposition has been a subject of interest in process algebra for a long time (for example in BPP [2] or CCS [11,13]), as it provides a normal form with useful cancellation properties. We provide two parallel decomposition results for subsets of the Applied π-Calculus: we show that any closed normed (i.e. with a finite shortest complete trace) process P can be decomposed uniquely into prime factors Pi with respect to strong labeled bisimilarity, i.e. such that P ~lP1 | …| Pn. We also prove that closed finite processes can be decomposed uniquely with respect to weak labeled bisimilarity.