Mobile values, new names, and secure communication, Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '01, pp.104-115, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-01423924
Decidability and Decompostion in Process Algebras, 1993. ,
Defining Privacy for Weighted Votes, Single and Multi-voter Coercion, Proceedings of the 17th European Symposium on Research in Computer Security (ESORICS), pp.451-468, 2012. ,
DOI : 10.1007/978-3-642-33167-1_26
URL : https://hal.archives-ouvertes.fr/hal-01338037
Verification of parallel systems via decomposition, CON- CUR '92: Proceedings of the Third International Conference on Concurrency Theory, pp.62-76, 1992. ,
On Bisimilarity and Substitution in Presence of Replication, 37th International Colloquium on Automata, Languages and Programming (ICALP), pp.454-465, 2010. ,
DOI : 10.1007/978-3-642-14162-1_38
URL : https://hal.archives-ouvertes.fr/hal-00375604
A proof of coincidence of labeled bisimilarity and observational equivalence in applied pi calculus, p.4, 2011. ,
Unique parallel decomposition in branching and weak bisimulation semantics, 2012. ,
Decomposition orders???another generalisation of the fundamental theorem of arithmetic, Theoretical Computer Science, vol.335, issue.2-3, pp.147-186, 2005. ,
DOI : 10.1016/j.tcs.2004.11.019
Communication and Concurrency. International Series in Computer Science, 1989. ,
Unique decomposition of processes, Theoretical Computer Science, vol.107, issue.2, pp.357-363, 1993. ,
DOI : 10.1016/0304-3975(93)90176-T
A calculus of mobile processes, I, Information and Computation, vol.100, issue.1, pp.1-40, 1992. ,
DOI : 10.1016/0890-5401(92)90008-4
Axioms for Concurrency, 1989. ,
Decoding choice encodings. Information and Computation, pp.1-59, 2000. ,
A randomized encoding of the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-calculus with mixed choice, Theoretical Computer Science, vol.335, issue.2-3, pp.373-404, 2005. ,
DOI : 10.1016/j.tcs.2004.11.020
Consider the relation R = {(A, 0)}. We will show that it fulfills the conditions of strong labeled bisimilarity ,
|B l |C 1 | . . . |C m . These are prime factorizations, and by Theorem 4 they are unique. As A|C ? l B|C, they have to be identical. Hence k + m = l + m, thus k = l. We will show that this implies that the factorizations of A and B have to be identical (up to ? l ), which implies A ? l B. Consider the following cases: If k = 0, A ? l 0. As l = k = 0, B ? l 0, and A and B have the same prime factorization. If k > 0, we have A ? l A 1 | . . . |A k . Let count(A i , P ) denote the number of prime factors P r of P with P r ? l A i . Suppose that there exists a prime factor A i with count(A i , A) = count(A i, and count(A i , A|C) = count(A i , A) + count(A i , C) = count(A i , B) + count(A i , C) = count(A i , B|C), which contradicts the fact that A|C and B|C have the same prime factorization ,