A. Ciaffaglione, M. Hennessy, and &. , Proof Methodologies for Behavioural Equivalence in Dpi, Lecture Notes in Computer Science, vol.3731, pp.335-350, 2005.
DOI : 10.1007/978-3-540-24727-2_18

L. Damas and &. , Milner ? « Principal type-schemes for functional programs, Proceedings of the 9th ACM Symposium on Principles of Programming Languages, pp.207-212, 1982.

&. [. Francalanza, A Theory of System Behaviour in the Presence of Node and Link Failures, CONCUR (M. Abadi & L. de Alfaro, pp.368-382, 2005.
DOI : 10.1007/11539452_29

V. Gapeyev, M. Levin, and &. , Pierce ? « Recursive subtyping revealed, Une version préliminaire est parue dans les actes de l'International Conference on Functional Programming (ICFP), pp.511-548, 2000.

M. Hennessy, M. Merro, and &. , Towards a behavioural theory of access and mobility control in distributed systems, Theoretical Computer Science, vol.322, issue.3, pp.615-669, 2003.
DOI : 10.1016/j.tcs.2003.12.024

M. Hennessy and &. , Riely ? « Resource access control in systems of mobile agents, pp.82-120, 2002.

&. [. Jensen, Milner ? « Bigraphs and mobile processes (revised) A theory of bisimulation for a fragment of concurrent ML with local names, Theoretical Computer Science, vol.323, pp.1-48, 2004.

&. [. Larsen, Verifying a protocol using relativized bisimulation, Proceedings 14 th ICALP, pp.126-135, 1987.
DOI : 10.1007/3-540-18088-5_11

R. Milner, J. Parrow, and &. , Walker ? « A calculus of mobile processes, I + II, pp.1-40, 1992.

F. Martins and &. V. , History-Based Access Control for Distributed Processes, Lecture Notes in Computer Science, vol.3705, pp.98-115, 2005.
DOI : 10.1007/11580850_7

]. S. Oak01, ?. Oaks, . Java, &. O-'reilly, . Associates et al., pub-ORA :adr, 2001, Covers JAAS and JSEE ; Writing and deploying secure applications

]. J. Par87, Parrow ? « Verifying a CSMA/CD-protocol with CCS, pp.224-87, 1987.

&. [. Riely, Hennessy ? « Trust and partial typing in open systems of mobile agents, J. Autom. Reasoning, vol.31, pp.3-4, 2003.

]. M. She18, ?. Shelley, and . Frankenstein, or The Modern Prometheus, 1818.

&. [. Sangiorgi, Walker ? The ?-calculus : a theory of mobile processes, 2001.

]. D. Wal89, Walker ? « Automated analysis of mutual exclusion algorithms using CCS, Formal Aspects of Computing, vol.1, issue.3, pp.273-292, 1989.