R. Milner, Communication and Concurrency. International Series on Computer Science, 1989.

J. Lévy, Réductions optimales en ?-calcul, 1978.

G. Berry and J. Lévy, Minimal and Optimal Computations of Recursive Programs, Journal of the ACM, vol.26, issue.1, pp.148-175, 1979.
DOI : 10.1145/322108.322122

A. Regev, W. Silverman, and E. Shapiro, Representation and simulation of biochemical processes using the ??-calculus process algebra, Biocomputing 2001, pp.459-470, 2001.
DOI : 10.1142/9789814447362_0045

C. Priami, A. Regev, E. Shapiro, and W. Silverman, Application of a stochastic name-passing calculus to representation and simulation of molecular processes, Information Processing Letters, vol.80, issue.1, 2001.
DOI : 10.1016/S0020-0190(01)00214-9

V. Danos and J. Krivine, Formal Molecular Biology Done in CCS-R, Proceedings of BIO-CONCUR'03, 2003.
DOI : 10.1016/j.entcs.2004.01.040

K. V. Prasad, Combinators and bisimulation proofs for restartable systems, 1987.

J. A. Bergstra, A. Ponse, and J. Van-wamel, Process algebra with backtracking, REX School Symposium, pp.46-91, 1993.
DOI : 10.1007/3-540-58043-3_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.8605

G. Boudol and I. Castellani, Permutation of transitions: An event structure semantics for CCS and SCCS. Lecture Notes in Computer Science: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pp.411-427, 1989.

P. Degano, R. D. Nicola, and U. Montanari, A partial ordering semantics for CCS, Theoretical Computer Science, vol.75, issue.3, pp.223-262, 1990.
DOI : 10.1016/0304-3975(90)90095-Y
URL : http://doi.org/10.1016/0304-3975(90)90095-y

G. Boudol, I. Castellani, M. Hennesy, and A. Kiehn, Observing localities, Proceedings MFCS'91, pp.31-61, 1991.
DOI : 10.1016/0304-3975(93)90152-j
URL : https://hal.archives-ouvertes.fr/inria-00075077

P. Degano and C. Priami, Proved trees, Automata, Languages and Programming, pp.629-640, 1992.
DOI : 10.1007/3-540-55719-9_110

G. Boudol, I. Castellani, M. Hennesy, and A. Kiehn, A theory of processes with localities. Formal Aspect of Computing, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00074929

I. Castellani, OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES, International Journal of Foundations of Computer Science, vol.06, issue.04, pp.353-393, 1995.
DOI : 10.1142/S0129054195000196
URL : https://hal.archives-ouvertes.fr/inria-00074395

P. Degano and C. Priami, Non-interleaving semantics for mobile processes, Automata, Languages and Programming, pp.660-667, 1995.
DOI : 10.1016/S0304-3975(99)80003-6

M. Boreale and D. Sangiorgi, A fully abstract semantics for causality in the ??-calculus, Acta Informatica, vol.35, 1998.
DOI : 10.1007/3-540-59042-0_77

G. Winskel, Event Structure Semantics for CCS and Related Languages, Proceedings of 9th ICALP, pp.561-576, 1982.
DOI : 10.7146/dpb.v12i159.6812

A. Marek and . Bednarczyk, Hereditary history preserving bisimulations or what is the power of the future perfect in program logics, ICS PAS Report, 1991.