R. 1. Aceto, M. Cimini, and A. Ingólfsdóttir, Proving the validity of equations in GSOS languages using rule-matching bisimilarity, Mathematical Structures in Computer Science, vol.3, issue.61, pp.291-331, 2012.
DOI : 10.1145/963927.963929

L. Aceto, W. Fokkink, A. Ingólfsdóttir, and B. Luttik, Finite equational bases in process algebra: Results and open questions, Processes, Terms and Cycles, pp.338-367, 2005.
DOI : 10.7146/brics.v12i19.21885
URL : http://www.cs.vu.nl/~wanf/pubs/jwk60.pdf

P. Baldan, A. Bracciali, and R. Bruni, A semantic framework for open processes, Theoretical Computer Science, vol.389, issue.3, pp.446-483, 2007.
DOI : 10.1016/j.tcs.2007.09.004
URL : https://doi.org/10.1016/j.tcs.2007.09.004

F. Bartels, On generalised coinduction and probabilistic specification formats, 2004.

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
URL : http://ecommons.cornell.edu/bitstream/1813/6990/1/90-1150.pdf

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

R. De-simone, Higher-level synchronising devices in Meije-SCCS, Theoretical Computer Science, vol.37, pp.245-267, 1985.
DOI : 10.1016/0304-3975(85)90093-3

H. H. Hansen and B. Klin, Pointwise extensions of GSOS-defined operations, Mathematical Structures in Computer Science, vol.803, issue.02, pp.321-361, 2011.
DOI : 10.1016/B978-044482830-9/50021-7

H. H. Hansen and J. J. Rutten, Symbolic synthesis of mealy machines from arithmetic bitstream functions, Sci. Ann. Comp. Sci, vol.20, pp.97-130, 2010.

B. Klin, Bialgebras for structural operational semantics: An introduction, Theoretical Computer Science, vol.412, issue.38, pp.5043-5069, 2011.
DOI : 10.1016/j.tcs.2011.03.023
URL : https://doi.org/10.1016/j.tcs.2011.03.023

D. Lucanu, E. Goriac, G. Caltais, and G. Rosu, CIRC: A Behavioral Verification Tool Based on Circular Coinduction, CALCO 2009. Proc, pp.433-442, 2009.
DOI : 10.1007/978-3-642-03741-2_10

M. Mousavi, M. Reniers, and J. 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

A. Popescu and E. L. Gunter, Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization, FOSSACS, Proc, pp.109-127, 2010.
DOI : 10.1007/978-3-642-12032-9_9
URL : https://www.ideals.illinois.edu/bitstream/handle/2142/14858/Coind.pdf?sequence=2

D. Pous and D. Sangiorgi, Enhancements of the bisimulation proof method, Advanced Topics in Bisimulation and Coinduction
DOI : 10.1017/CBO9780511792588.007
URL : https://hal.archives-ouvertes.fr/hal-00909391

A. Rensink, Bisimilarity of Open Terms, Information and Computation, vol.156, issue.1-2, pp.345-385, 2000.
DOI : 10.1006/inco.1999.2818
URL : https://doi.org/10.1016/s1571-0661(05)80477-3

J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000.
DOI : 10.1016/S0304-3975(00)00056-6

J. Rutten, Elements of stream calculus (an extensive exercise in coinduction), ENTCS, vol.45, pp.358-423, 2001.

J. Rutten, A tutorial on coinductive stream calculus and signal flow graphs, Theoretical Computer Science, vol.343, issue.3, pp.443-481, 2005.
DOI : 10.1016/j.tcs.2005.06.019
URL : https://doi.org/10.1016/j.tcs.2005.06.019

D. Turi and G. D. Plotkin, Towards a mathematical operational semantics, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.280-291, 1997.
DOI : 10.1109/LICS.1997.614955
URL : http://www.dcs.ed.ac.uk/home/gdp/publications/Math_Op_Sem.ps.gz

H. Zantema and J. Endrullis, Proving equality of streams automatically, Proceedings of RTA 2011, pp.393-408, 2011.