M. If and . M. ?x, M ) is the tree with a root labelled with "?x, and LT (M ) as its unique descendant

M. ?. If and M. , M n , then LT (M ) is the tree with a root labelled with, and LT (M 1 ), . . . , LT (M n )

L. Aceto, W. Fokkink, and C. Verhoef, Handbook of Process Algebra, chapter Structural operational semantics, 2001.

C. M. Jos, T. Baeten, M. A. Basten, and . Reniers, Process Algebra: Equational Theories of Communicating Processes, 2010.

S. Bloom, A. R. Istrail, and . Meyer, Bisimulation can't be traced, Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pp.229-239, 1988.
DOI : 10.1145/200836.200876

F. Bonchi, D. Petrisan, D. Pous, and J. Rot, A general account of coinduction up-to, Acta Informatica, vol.43, issue.3, pp.127-190, 2017.
DOI : 10.1145/233551.233556
URL : https://hal.archives-ouvertes.fr/hal-01442724

S. D. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.31560-599, 1984.
DOI : 10.1145/828.833

D. Stephen, A. W. Brookes, and . Roscoe, An improved failures model for communicating processes, Seminar on Concurrency, pp.281-305, 1984.

R. Demangeon, D. Hirschkoff, and D. Sangiorgi, Termination in Impure Concurrent Languages, CONCUR 2010 -Concurrency Theory, 21th International Conference, pp.328-342, 2010.
DOI : 10.1007/978-3-642-15375-4_23
URL : https://hal.archives-ouvertes.fr/hal-00798789

A. Durier, Divergence and unique solution of equations in an abstract setting, Coq formal proof, p.2017

W. Fokkink and R. J. Van-glabbeek, Divide and Congruence II, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.778-787, 2016.
DOI : 10.1007/3-540-44618-4_21

J. Friso-groote and M. R. Mousavi, Modeling and Analysis of Communicating Systems, 2014.

J. Friso-groote and F. W. Vaandrager, Structured operational semantics and bisimulation as a congruence, Information and Computation, vol.100, issue.2, pp.202-260, 1992.
DOI : 10.1016/0890-5401(92)90013-6

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

R. Milner, Communication and concurrency. PHI Series in computer science, 1989.

R. Milner, Functions as processes, Mathematical Structures in Computer Science, vol.4, issue.02, pp.119-141, 1992.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075405

R. Milner, Communicating and mobile systems -the Pi-calculus, 1999.

M. R. Mousavi, M. A. Reniers, and J. F. Groote, SOS formats and meta-theory: 20 years after, Theoretical Computer Science, vol.373, issue.3, pp.238-272, 2007.
DOI : 10.1016/j.tcs.2006.12.019
URL : https://doi.org/10.1016/j.tcs.2006.12.019

D. Pous and E. Lyon, Up to techniques for bisimulations, 2008.
URL : https://hal.archives-ouvertes.fr/tel-01441480

D. Pous, Coinduction All the Way Up, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.307-316, 2016.
DOI : 10.1109/LICS.1997.614955
URL : https://hal.archives-ouvertes.fr/hal-01259622

D. Pous and D. Sangiorgi, Advanced Topics in Bisimulation and Coinduction (D. Sangiorgi and J. Rutten editors), chapter Enhancements of the coinductive proof method, 2011.

W. Roscoe, An Alternative Order for the Failures Model, Journal of Logic and Computation, vol.2, issue.5, pp.557-577, 1992.
DOI : 10.1093/logcom/2.5.557

W. Roscoe, The Theory and Practice of Concurrency, 1997.

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

M. M. Bonsangue and J. J. Rutten, Coalgebraic bisimulationup-to, Divergence and unique solution of equations 23 Jurriaan Rot SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, pp.369-381, 2013.

D. Sangiorgi, Lazy functions and mobile processes, Proof, Language and Interaction: Essays in Honour of Robin Milner, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00074163

D. Sangiorgi, Equations, contractions, and unique solutions, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp.421-432, 2015.
DOI : 10.1145/2775051.2676965
URL : https://hal.archives-ouvertes.fr/hal-01089205

D. Sangiorgi and D. Walker, The Pi-Calculus -a theory of mobile processes, 2001.

D. Sangiorgi and X. Xu, Trees from Functions as Processes, 25th International Conference, pp.78-92, 2014.
DOI : 10.1007/978-3-662-44584-6_7
URL : https://hal.archives-ouvertes.fr/hal-01092809

J. Van-glabbeek, The linear time-branching time spectrum (extended abstract) In CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, Proceedings, pp.278-297, 1990.

J. Van-glabbeek, On cool congruence formats for weak bisimulations, Theoretical Aspects of Computing -ICTAC 2005, Second International Colloquium, pp.318-333, 2005.

N. Yoshida, M. Berger, and K. Honda, Strong normalisation in the ??-calculus, Information and Computation, vol.191, issue.2, pp.145-202, 2004.
DOI : 10.1016/j.ic.2003.08.004
URL : http://www.doc.ic.ac.uk/~yoshida/paper/tr-2001-09.ps.gz