S. Arun-kumar and M. Hennessy, An efficiency preorder for processes, Acta Informatica, vol.25, issue.1, pp.737-760, 1992.
DOI : 10.1007/BF01191894

S. Arun-kumar and V. Natarajan, Conformance: A Precongruence close to Bisimilarity, Proc. Struct. in Concurrency Theory, 1995.
DOI : 10.1007/978-1-4471-3078-9_4

B. Davey and H. Priestley, Introduction to Lattices and Order, 1990.
DOI : 10.1017/CBO9780511809088

H. Doornbos, R. Backhouse, and J. Van-der-woude, A calculational approach to mathematical induction, Theoretical Computer Science, vol.179, issue.1-2, pp.103-135, 1997.
DOI : 10.1016/S0304-3975(96)00154-5

C. Fournet, The Join-Calculus: a Calculus for Distributed Mobile Programming, 1998.

C. Fournet, J. Lévy, and A. Schmitt, An Asynchronous, Distributed Implementation of Mobile Ambients, Proc. IFIP TCS'00, pp.348-364, 2000.
DOI : 10.1007/3-540-44929-9_26

C. Fournet and G. Gonthier, A hierarchy of equivalences for asynchronous calculi, The Journal of Logic and Algebraic Programming, vol.63, issue.1, pp.131-173, 2005.
DOI : 10.1016/j.jlap.2004.01.006

M. Hennessy and J. Rathke, Typed behavioural equivalences for processes in the presence of subtyping, Mathematical Structures in Computer Science, vol.14, issue.5, pp.651-684, 2004.
DOI : 10.1017/S0960129504004281

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7

D. J. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996.
DOI : 10.1006/inco.1996.0008

S. B. Lassen, Relational Reasoning about Contexts, Higher Order Operational Techniques in Semantics, 1998.
DOI : 10.7146/brics.v4i24.18950
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5332

R. Milner, Communication and Concurrency, 1989.

D. Pous, On Bisimulation Proofs for the Analysis of Distributed Abstract Machines, Proc. TGC '06, 2006.
DOI : 10.1007/978-3-540-75336-0_10
URL : https://hal.archives-ouvertes.fr/hal-01441457

D. Pous, Weak Bisimulation Up to Elaboration, Proc. CONCUR '06, pp.390-405, 2006.
DOI : 10.1007/11817949_26
URL : https://hal.archives-ouvertes.fr/hal-01441462

D. Pous, Complete Lattices and Up-To Techniques, Proc. APLAS '07, pp.351-366, 2007.
DOI : 10.1007/978-3-540-76637-7_24
URL : https://hal.archives-ouvertes.fr/ensl-00155308

D. Pous, New up-to techniques for weak bisimulation, Proc. ICALP '05, 2007.
DOI : 10.1016/j.tcs.2007.02.060
URL : https://hal.archives-ouvertes.fr/hal-01442745

D. Sangiorgi, On the bisimulation proof method, Mathematical Structures in Computer Science, vol.8, issue.5, pp.447-479, 1998.
DOI : 10.1017/S0960129598002527

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higherorder languages, Proc. LICS '07, pp.293-302, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01337665

D. Sangiorgi and R. Milner, The problem of ???weak bisimulation up to???, Proc. 3rd CONCUR, pp.32-46, 1992.
DOI : 10.1007/BFb0084781

D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, 2001.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285