L. Bocchi and &. Wischik, A Process Calculus of Atomic Commit, Proceedings of the First International Workshop on Web Services and Formal Methods, pp.119-132, 2004.
DOI : 10.1016/j.entcs.2004.05.003

M. Boreale, C. Fournet, and &. C. Laneve, Bisimulations in the Join-Calculus, pp.68-86, 1998.
DOI : 10.1007/978-0-387-35358-6_9

J. Borgström, R. Gutkovas, J. Parrow, B. Victor, and &. Pohjola, A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) In: Trustworthy Global Computing, pp.103-118, 2013.

N. Busi, R. Gorrieri, and &. Zavattaro, On the Expressiveness of Linda Coordination Primitives, Information and Computation, vol.156, issue.1-2, pp.90-121, 2000.
DOI : 10.1006/inco.1999.2823

M. Carbone and &. Maffeis, On the Expressive Power of Polyadic Synchronisation in ??-calculus, Electronic Notes in Theoretical Computer Science, vol.68, issue.2, pp.70-98, 2003.
DOI : 10.1016/S1571-0661(05)80361-5

G. Castagna, R. De-nicola, and &. Varacca, Semantic subtyping for the pi-calculus, Theoretical Computer Science, vol.398, issue.1-3, pp.217-242, 2008.
DOI : 10.1016/j.tcs.2008.01.049
URL : https://hal.archives-ouvertes.fr/hal-00148929

R. De-nicola, D. Gorla, and &. Rosario-pugliese, On the expressive power of KLAIM-based calculi, Theoretical Computer Science, vol.356, issue.3, pp.387-421, 2006.
DOI : 10.1016/j.tcs.2006.02.007

C. Fournet and &. Georges-gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.372-385
DOI : 10.1145/237721.237805

D. Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems, vol.7, issue.1, pp.80-112, 1985.
DOI : 10.1145/2363.2433

T. Given-wilson, Concurrent Pattern Unification, 2012.

T. Given-wilson, An Intensional Concurrent Faithful Encoding of Turing Machines, 7th Interaction and Concurrency Experience, 2014.
DOI : 10.4204/EPTCS.166.4
URL : https://hal.archives-ouvertes.fr/hal-00987594

T. Given-wilson, On the Expressiveness of Intensional Communication, Combined 21th International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, 2014.
DOI : 10.4204/EPTCS.160.4
URL : https://hal.archives-ouvertes.fr/hal-01026301

T. Given-wilson and D. Gorla, Pattern Matching and Bisimulation, Lecture Notes in Computer Science, vol.7890, pp.60-74, 2013.
DOI : 10.1007/978-3-642-38493-6_5
URL : https://hal.archives-ouvertes.fr/hal-01486035

T. Given-wilson, D. Gorla, and &. Jay, Concurrent Pattern Calculus In: Theoretical Computer Science, IFIP Advances in Information and Communication Technology 323, pp.244-258, 2010.

T. Given-wilson, D. Gorla, and &. Jay, A Concurrent Pattern Calculus, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00987578

D. Gorla, Comparing communication primitives via their relative expressive power, Information and Computation, vol.206, issue.8, pp.931-952, 2008.
DOI : 10.1016/j.ic.2008.05.001

D. Gorla, A taxonomy of process calculi for distribution and mobility, Distributed Computing, vol.13, issue.5, pp.273-299, 2010.
DOI : 10.1007/s00446-010-0120-6

D. Gorla, Towards a unified approach to encodability and separation results for process calculi, Information and Computation, vol.208, issue.9, pp.1031-1053, 2010.
DOI : 10.1016/j.ic.2010.05.002

C. Haack and &. Jeffrey, Pattern-matching spi-calculus, Information and Computation, vol.204, issue.8, pp.1195-1263, 2006.
DOI : 10.1016/j.ic.2006.04.004

K. Honda and &. Tokoro, An object calculus for asynchronous communication, ECOOP'91 European Conference on Object-Oriented Programming, pp.133-147, 1991.
DOI : 10.1007/BFb0057019

K. Honda and &. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.152, issue.95, pp.437-48610, 1995.

I. Lanese, J. A. Pérez, D. Sangiorgi, and &. Schmitt, On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi, Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pp.442-453, 2010.
DOI : 10.1007/978-3-642-14162-1_37
URL : https://hal.archives-ouvertes.fr/inria-00514912

I. Lanese, C. Vaz, and C. Ferreira, On the Expressive Power of Primitives for Compensation Handling, Proceedings of the 19th European Conference on Programming Languages and Systems, ESOP'10, pp.366-386, 2010.
DOI : 10.1007/978-3-642-11957-6_20

R. Milner, The polyadic ??-calculus, NATO ASI, 1993.
DOI : 10.1007/BFb0084778

R. Milner, J. Parrow, and &. Walker, A Calculus of Mobile Processes, I. Information and Computation, pp.1-4010, 1992.

R. Milner, J. Parrow, and &. Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.41-7710, 1992.
DOI : 10.1016/0890-5401(92)90009-5

R. De-nicola, G. L. Ferrari, and R. Pugliese, KLAIM: a kernel language for agents interaction and mobility, IEEE Transactions on Software Engineering, vol.24, issue.5, pp.315-33010, 1998.
DOI : 10.1109/32.685256

C. Palamidessi, Comparing the expressive power of the synchronous and asynchronous $pi$ -calculi, Mathematical Structures in Computer Science, vol.13, issue.5, pp.685-71910, 2003.
DOI : 10.1017/S0960129503004043
URL : https://hal.archives-ouvertes.fr/inria-00201104

V. A. Saraswat, M. Rinard, and &. Prakash-panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-35210, 1991.
DOI : 10.1145/99583.99627

A. Schmitt and &. Stefani, The m-calculus: a higher-order distributed process calculus, Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.50-61, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072227

C. Urban, S. Berghofer, and &. Michael-norrish, Barendregt???s Variable Convention in Rule Inductions, Lecture Notes in Computer Science, vol.4603, pp.35-50, 2007.
DOI : 10.1007/978-3-540-73595-3_4