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

J. C. Baeten, T. Basten, and M. A. Reniers, Process Algebra: Equational Theories of Communicating Processes, 2010.
DOI : 10.1017/CBO9781139195003

C. M. Jos, J. A. Baeten, J. W. Bergstra, and . Klop, Ready-trace semantics for concrete process algebra with the priority operator, Comput. J, vol.30, issue.6, pp.498-506, 1987.

C. M. Jos, B. Baeten, and . Luttik, Unguardedness mostly means many solutions, Theor. Comput. Sci, vol.412, issue.28, pp.3090-3100, 2011.

B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation can't be traced, Journal of the ACM, vol.42, issue.1, pp.232-268, 1995.
DOI : 10.1145/200836.200876

F. Bonchi, D. Petrisan, D. Pous, and J. Rot, Coinduction up-to in a fibrational setting, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603149

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

F. Bonchi and D. Pous, Checking nfa equivalence with bisimulations up to congruence, Proc. POPL'13, pp.457-468, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00639716

R. Cleaveland and M. Hennessy, Testing equivalence as a bisimulation equivalence, Formal Aspects of Computing, vol.85, issue.n. 2, pp.1-20, 1993.
DOI : 10.1007/BF01211314

R. , D. Nicola, and R. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, pp.83-133, 1984.

R. J. Van-glabbeek, The linear time ??? Branching time spectrum II, Proc. CON- CUR '93, 1993.
DOI : 10.1007/3-540-57208-2_6

R. J. Van-glabbeek, The linear time - branching time spectrum, Handbook of Process Algebra, pp.3-99, 2001.
DOI : 10.1007/BFb0039066

C. A. Hoare, Communicating Sequential Processes, 1985.

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.152, issue.2, pp.437-486, 1995.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2006.

G. Hutton and M. Jaskelioff, Representing Contractive Functions on Streams, 2011.

V. Koutavas and M. Wand, Small bisimulations for reasoning about higher-order imperative programs, Proc. POPL'06, pp.141-152, 2006.

M. Kunc, Simple language equations, Bulletin of the EATCS, vol.85, pp.81-102, 2005.

S. B. Lassen, Relational Reasoning about Contexts, Higher-order operational techniques in semantics, pp.91-135, 1998.
DOI : 10.7146/brics.v4i24.18950

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5332

S. B. Lassen, Bisimulation in Untyped Lambda Calculus:, Electronic Notes in Theoretical Computer Science, vol.20, pp.346-374, 1999.
DOI : 10.1016/S1571-0661(04)80083-5

S. Milius, L. S. Moss, and D. Schwencke, Abstract GSOS Rules and a Modular Treatment of Recursive Definitions, Logical Methods in Computer Science, vol.9, issue.3, p.2013
DOI : 10.2168/LMCS-9(3:28)2013

R. Milner, Communication and Concurrency, 1989.

R. Milner and D. Sangiorgi, Barbed bisimulation, Proc. 19th ICALP, 1992.
DOI : 10.1007/3-540-55719-9_114

R. Milner, A complete axiomatisation for observational congruence of finite-state behaviours, Information and Computation, vol.81, issue.2, pp.227-247, 1989.
DOI : 10.1016/0890-5401(89)90070-9

J. H. Morris, Lambda-Calculus Models of Programming Languages, 1968.

V. Natarajan and R. Cleaveland, Divergence and fair testing, Proceedings of ICALP'95, pp.648-659, 1995.
DOI : 10.1007/3-540-60084-1_112

I. Petre and A. Salomaa, Algebraic Systems and Pushdown Automata, Handbook of Weighted Automata, EATCS Series, pp.257-289, 2009.
DOI : 10.1007/978-3-642-01492-5_7

A. Piérard and E. Sumii, Sound Bisimulations for Higher-Order Distributed Process Calculus, Proc. FOSSACS, pp.123-137, 2011.
DOI : 10.1007/978-3-642-19805-2_9

A. Pitts, Howe's method. In Advanced Topics in Bisimulation and Coinduction, 2012.

D. Pous and D. Sangiorgi, Enhancements of the bisimulation proof method, Advanced Topics in Bisimulation and Coinduction, 2012.
DOI : 10.1017/CBO9780511792588.007

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

A. Rensink and W. Volger, Fair testing. Information and Computation, pp.125-198, 2007.

A. W. Roscoe, The theory and practice of concurrency, 1998.

A. W. Roscoe, Understanding Concurrent Systems, 2010.
DOI : 10.1007/978-1-84882-258-0

J. Rot, M. M. Bonsangue, and J. J. Rutten, Coinductive Proof Techniques for Language Equivalence, Proc. LATA, pp.480-492, 2013.
DOI : 10.1007/978-3-642-37064-9_42

D. Sands, Computing With Contexts A simple approach, Electronic Notes in Theoretical Computer Science, vol.10, 1998.
DOI : 10.1016/S1571-0661(05)80694-2

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

D. Sangiorgi, Locality and true-concurrency in calculi for mobile processes, Proc. TACS '94, pp.405-424, 1994.
DOI : 10.1007/3-540-57887-0_107

D. Sangiorgi, Equations, contractions, and unique solutions, Proc. POPL 15, pp.421-432, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01089205

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

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higher-order languages, ACM Trans. Program. Lang. Syst, vol.33, issue.1, p.5, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01337665