J. Bengtson, M. Johansson, J. Parrow, and B. Victor, Psi-calculi: a framework for mobile processes with nominal data and logic, Logical Methods in Computer Science, vol.7, issue.1, 2011.
DOI : 10.2168/LMCS-7(1:11)2011

J. Bengtson and J. Parrow, Formalising the pi-calculus using nominal logic, Logical Methods in Computer Science, vol.5, issue.2, 2009.
DOI : 10.2168/LMCS-5(2:16)2009

L. Bocchi and L. 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 J. Å. Pohjola, A sorted semantic framework for applied process calculi (extended abstract) In: Trustworthy Global Computing, pp.103-118, 2013.

G. Boudol, Notes on Algebraic Calculi of Processes, pp.261-303, 1985.
DOI : 10.1007/978-3-642-82453-1_9
URL : https://hal.archives-ouvertes.fr/inria-00076161

G. Boudol, Asynchrony and the pi-calculus, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00076939

N. Busi, R. Gorrieri, and G. 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 S. 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

L. Cardelli and A. D. Gordon, Mobile ambients, Foundations of Software Science and Computation Structures: First International Conference, FoSSaCS '98, pp.140-155, 1998.
DOI : 10.1016/s0304-3975(99)00231-5
URL : http://doi.org/10.1016/s0304-3975(99)00231-5

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

D. Nicola, R. Gorla, D. Pugliese, and R. , 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

R. De-simone, Higher-level synchronising devices in Meije-SCCS, Theoretical Computer Science, vol.37, pp.245-267, 1985.
DOI : 10.1016/0304-3975(85)90093-3

C. Ene and T. Muntean, A broadcast-based calculus for communicating systems, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, pp.30149-30149, 2001.
DOI : 10.1109/IPDPS.2001.925136
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.2165

C. Fournet and G. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.9679

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

T. Given-wilson, An Intensional Concurrent Faithful Encoding of Turing Machines, Proceedings 7th Interaction and Concurrency Experience, pp.21-37, 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, In: Coordination Models and Languages. 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 B. Jay, Concurrent Pattern Calculus, of IFIP Advances in Information and Communication Technology, pp.244-258, 2010.
DOI : 10.1007/978-3-642-15240-5_18
URL : https://hal.archives-ouvertes.fr/hal-00987578

T. Given-wilson, D. Gorla, and B. Jay, A Concurrent Pattern Calculus, Logical Methods in Computer Science, vol.10, issue.3, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00987578

T. Given-wilson and A. Legay, On the Expressiveness of Joining, 8th Interaction and Concurrency Experience, 2015.
DOI : 10.4204/EPTCS.189.9
URL : https://hal.archives-ouvertes.fr/hal-01152456

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
URL : http://doi.org/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 A. Jeffrey, Pattern-matching spi-calculus, Information and Computation, vol.204, issue.8, pp.1195-1263, 2006.
DOI : 10.1016/j.ic.2006.04.004
URL : http://doi.org/10.1016/j.ic.2006.04.004

K. Honda and M. 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 N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.152, pp.437-486, 1995.
DOI : 10.1007/3-540-57529-4_70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9756

I. Lanese, J. A. Pérez, D. Sangiorgi, and A. 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: a Tutorial, of Series F. NATO ASI, 1993.
DOI : 10.1007/978-3-642-58041-3_6

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I. Information and Computation, pp.1-40, 1992.

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

R. D. 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-330, 1998.
DOI : 10.1109/32.685256

L. Nielsen, N. Yoshida, and K. Honda, Multiparty Symmetric Sum Types, Proceedings of the 17th International Workshop on Expressiveness in Concurrency, pp.121-135, 2010.
DOI : 10.4204/EPTCS.41.9
URL : http://doi.org/10.4204/eptcs.41.9

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

J. Parrow, Expressiveness of Process Algebras, Electronic Notes in Theoretical Computer Science, vol.209, pp.173-186, 2008.
DOI : 10.1016/j.entcs.2008.04.011

K. V. Prasad, A calculus of broadcasting systems, Science of Computer Programming, vol.25, issue.2-3, pp.285-327, 1995.
DOI : 10.1016/0167-6423(95)00017-8

V. A. Saraswat, M. Rinard, and P. 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-352, 1991.
DOI : 10.1145/99583.99627

A. Schmitt and J. 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