M. Abadi and A. D. Gordon, A calculus for cryptographic protocols: The spi calculus, Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS '97, pp.36-47, 1997.

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.

J. Bengtson and J. Parrow, Formalising the pi-calculus using nominal logic, Logical Methods in Computer Science, vol.5, issue.2, 2009.

L. Bocchi and L. Wischik, A process calculus of atomic commit, Proceedings of the First International Workshop on Web Services and Formal Methods, vol.105, issue.0, pp.119-132, 2004.

M. Boreale, C. Fournet, and C. Laneve, Bisimulations in the join-calculus, Programming Concepts and Methods PROCOMET '98, IFIP-The International Federation for Information Processing, pp.68-86, 1998.

G. Boudol, Notes on algebraic calculi of processes, Logics and Models of Concurrent Systems, pp.261-303, 1985.
URL : https://hal.archives-ouvertes.fr/inria-00076161

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

O. Burkart, D. Caucal, and B. Steffen, Bisimulation collapse and the process taxonomy, CONCUR '96, Concurrency Theory, 7th International Conference, vol.1119, pp.247-262, 1996.

N. Busi, R. Gorrieri, and G. Zavattaro, On the expressiveness of linda coordination primitives. Information and Computation, vol.156, pp.90-121, 2000.

M. Carbone and S. Maffeis, On the expressive power of polyadic synchronisation in ?-calculus, Nordic Journal of Computing, vol.10, issue.2, pp.70-98, 2003.

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 : https://doi.org/10.1016/s0304-3975(99)00231-5

S. Cassel, F. Howar, B. Jonsson, M. Merten, and B. Steffen, A succinct canonical register automaton model, J. Log. Algebr. Meth. Program, vol.84, issue.1, pp.54-66, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00647724

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

, Fundamental Approaches to Software Engineering-15th International Conference, FASE 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, vol.2012, 2012.

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-330, 1998.

R. De-nicola, D. Gorla, and R. Pugliese, On the expressive power of klaim-based calculi, Theoretical Computer Science, vol.356, issue.3, pp.387-421, 2006.

R. De-simone, Higher-level synchronising devices in Meije-SCCS, Theoretical Computer Science, vol.37, pp.245-267, 1985.

C. Ene and T. Muntean, A broadcast-based calculus for communicating systems, Parallel and Distributed Processing Symposium, International, vol.3, pp.30149-30149, 2001.

C. Fournet and G. Gonthier, The reflexive cham and the join-calculus, Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pp.372-385, 1996.

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, Proceedings 7th Interaction and Concurrency Experience, vol.166, 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, Coordination Models and Languages, 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, Theoretical Computer Science, vol.323, pp.244-258, 2010.
DOI : 10.1007/978-3-642-15240-5_18

URL : https://hal.archives-ouvertes.fr/hal-01054456

T. Given-wilson, D. Gorla, and B. Jay, A Concurrent Pattern Calculus, Logical Methods in Computer Science, vol.10, issue.3, 2014.
DOI : 10.2168/lmcs-10(3:10)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 (ICE 2015), 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, pp.931-952, 2008.
DOI : 10.1016/j.ic.2008.05.001

URL : https://doi.org/10.1016/j.ic.2008.05.001

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

URL : http://wwwusers.di.uniroma1.it/~gorla/papers/G-DC10.pdf

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.1007/978-3-540-85361-9_38

URL : http://wwwusers.di.uniroma1.it/~gorla/papers/G-CONCUR08.pdf

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

URL : https://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://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/59391/1/0902-2.pdf

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), vol.6199, pp.442-453, 2010.
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.

C. Laneve and A. Vitale, The expressive power of synchronizations, Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on, pp.382-391, 2010.
DOI : 10.1109/lics.2010.15

URL : http://www.cs.unibo.it/~laneve/papers/CCSn.pdf

T. Margaria and B. Steffen, Middleware: just another level for orchestration, Proceedings of the Workshop on Middleware for Next-Generation Converged Networks and Applications, MNCNA 2007, 2007.

R. Milner, The polyadic ?-calculus: A tutorial, Logic and Algebra of Specification, vol.94, 1993.
DOI : 10.1007/978-3-642-58041-3_6

URL : http://www.lix.polytechnique.fr/~fvalenci/papers/intro-ppi.pdf

R. Milner, Communicating and mobile systems-the Pi-calculus, 1999.

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

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

URL : https://doi.org/10.1016/0890-5401(92)90009-5

S. Naujokat, A. Lamprecht, and B. Steffen, Tailoring process synthesis to domain characteristics, 16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011, pp.167-175, 2011.
DOI : 10.1109/iceccs.2011.24

U. Nestmann, On the expressive power of joint input. Electronic Notes in Theoretical Computer Science, vol.16, pp.145-152, 1998.
DOI : 10.1016/s1571-0661(04)00123-9

URL : https://doi.org/10.1016/s1571-0661(04)00123-9

J. Neubauer and B. Steffen, Plug-and-play higher-order process integration, IEEE Computer, vol.46, issue.11, pp.56-62, 2013.
DOI : 10.1109/mc.2013.296

J. Neubauer, B. Steffen, and T. Margaria, Higher-order process modeling: Productlining, variability modeling and beyond, Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, vol.129, pp.259-283, 2013.
DOI : 10.4204/eptcs.129.16

URL : http://arxiv.org/pdf/1309.5143

L. Nielsen, N. Yoshida, and K. Honda, Multiparty symmetric sum types, Proceedings of the 17th International Workshop on Expressiveness in Concurrency (EXPRESS 2010), pp.121-135, 2010.
DOI : 10.4204/eptcs.41.9

URL : http://arxiv.org/pdf/1011.6436

H. R. Nielson, F. Nielson, and R. Vigo, A calculus for quality, Formal Aspects of Component Software, pp.188-204, 2012.

H. R. Nielson, F. Nielson, and R. Vigo, A calculus of quality for robustness against unreliable communication, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.5, pp.611-639, 2015.

C. Palamidessi, Comparing the expressive power of the synchronous and asynchronous pi-calculi, Mathematical. Structures in Comp. Sci, vol.13, issue.5, pp.685-719, 2003.
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

URL : https://doi.org/10.1016/j.entcs.2008.04.011

K. Peters, Translational expressiveness: comparing process calculi using encodings, 2012.

K. Peters, U. Nestmann, and U. Goltz, On distributability in process calculi, ESOP, pp.310-329, 2013.
DOI : 10.1007/978-3-642-37036-6_18

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-37036-6_18.pdf

K. V. Prasad, A calculus of broadcasting systems, Science of Computer Programming, vol.25, issue.2, pp.285-327, 1995.
DOI : 10.1007/3-540-53982-4_19

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-53982-4_19.pdf

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.
DOI : 10.1145/640128.604136

URL : https://hal.archives-ouvertes.fr/inria-00072227

B. Steffen, Unifying models, STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, vol.1200, pp.1-20, 1997.
DOI : 10.1007/bfb0023444

C. Urban, S. Berghofer, and M. Norrish, Barendregt's variable convention in rule inductions, Automated Deduction-CADE-21, vol.4603, pp.35-50, 2007.
DOI : 10.1007/978-3-540-73595-3_4

URL : http://www4.in.tum.de/~urbanc/Publications/cade07.ps

R. J. Van-glabbeek, Musings on encodings and expressiveness, Proceedings of EXPRESS/SOS, vol.89, pp.81-98, 2012.

R. J. Van-glabbeek, On the validity of encodings of the synchronous in the asynchronous ?-calculus, Inf. Process. Lett, vol.137, pp.17-25, 2018.