P. A. Abdulla, K. Cerans, B. Jonsson, and Y. Tsay, Algorithmic Analysis of Programs with Well Quasi-ordered Domains, Information and Computation, vol.160, issue.1-2, pp.109-127, 2000.
DOI : 10.1006/inco.1999.2843

L. Acciai and M. Boreale, Deciding safety properties in infinite-state pi-calculus via behavioural types, Proc. of ICALP, pp.31-42, 2009.
DOI : 10.1016/j.ic.2012.01.006

J. Baeten and J. Bergstra, Mode transfer in process algebra, 2000.

M. Berger and K. Honda, The two-phase commitment protocol in an extended pi-calculus, Electr. Notes Theor. Comput. Sci, vol.39, issue.1, 2000.

M. Bravetti, C. Di-giusto, J. A. Pérez, and G. Zavattaro, Adaptable processes, Logical Methods in Computer Science, vol.8, issue.4, 2011.
DOI : 10.2168/LMCS-8(4:13)2012

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

M. Bravetti, C. Di-giusto, J. A. Pérez, and G. Zavattaro, Steps on the Road to Component Evolvability, Post-proceedings of FACS'10, 2011.
DOI : 10.1007/978-3-540-31794-4_9

M. Bravetti and G. Zavattaro, On the expressive power of process interruption and compensation, Mathematical Structures in Computer Science, vol.4960, issue.03, pp.565-599, 2009.
DOI : 10.1007/s10270-006-0012-1

M. Bundgaard, J. C. Godskesen, and T. Hildebrandt, Bisimulation congruences for homer ? a calculus of higher order mobile embedded resources, 2004.

N. Busi, M. Gabbrielli, and G. Zavattaro, On the expressive power of recursion, replication and iteration in process calculi, Mathematical Structures in Computer Science, vol.2987, issue.06, pp.1191-1222, 2009.
DOI : 10.1007/978-3-540-24727-2_17

G. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Ad Hoc Networks, Proc. of CONCUR, pp.313-327, 2010.
DOI : 10.1007/978-3-642-15375-4_22

J. Esparza, Some applications of petri nets to the analysis of parameterised systems, 2003.

J. Esparza, A. Finkel, and R. Mayr, On the verification of broadcast protocols, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.352-359, 1999.
DOI : 10.1109/LICS.1999.782630

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere! Theor, Comput . Sci, vol.256, issue.12, pp.63-92, 2001.
DOI : 10.1016/s0304-3975(00)00102-x

URL : http://doi.org/10.1016/s0304-3975(00)00102-x

A. Francalanza and M. Hennessy, A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract), Proc. of ESOP, pp.395-410, 2007.
DOI : 10.1007/978-3-540-71316-6_27

R. Milner, Comunication and Concurrency, 1989.

M. Minsky, Computation: Finite and Infinite Machines, 1967.

U. Nestmann, R. Fuzzati, and M. Merro, Modeling Consensus in a Process Calculus, Proc. of CONCUR, pp.393-407, 2003.
DOI : 10.1007/978-3-540-45187-7_26

URL : http://basics.sjtu.edu.cn/~yuehg/concur/modeling consensus in a process calculus (2003).pdf

J. A. Pérez, Higher-Order Concurrency: Expressiveness and Decidability Results, 2010.

J. Riely and M. Hennessy, Distributed processes and location failures, Proc. of ICALP'97, pp.693-735, 2001.
DOI : 10.1016/S0304-3975(00)00326-1

URL : http://doi.org/10.1016/s0304-3975(00)00326-1

D. Sangiorgi, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, 1992.

A. Schmitt and J. Stefani, The Kell Calculus: A Family of Higher-Order Distributed Process Calculi, Global Computing, pp.146-178, 2004.
DOI : 10.1109/LICS.2000.855782

T. Wies, D. Zufferey, and T. A. Henzinger, Forward Analysis of Depth-Bounded Processes, FOSSACS, pp.94-108, 2010.
DOI : 10.1007/978-3-642-12032-9_8