S. Abramsky and A. Jung, Domain Theory, Handbook of Logic in Computer Science, pp.1-168, 1994.

P. Aczel and N. Mendler, A final coalgebra theorem, Proc. CTCS 1989, pp.357-365, 1989.
DOI : 10.1007/BFb0018361

C. Baier and H. Hermanns, Weak bisimulation for fully probabilistic processes, Proc. CAV 1997, pp.119-130, 1997.
DOI : 10.1007/3-540-63166-6_14

J. Beck, Distributive laws, Lecture Notes in Mathematics, vol.80, pp.119-140, 1969.
DOI : 10.1007/BFb0083084

N. Benton and M. Hyland, Traced Premonoidal Categories, Theoretical Informatics and Applications, pp.273-299, 2003.
DOI : 10.1051/ita:2003020
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.9365

S. L. Bloom and Z. Esik, Iteration Theories. The Equational Logic of Iterative Processes, 1993.
DOI : 10.1007/978-3-642-78034-9

T. Brengos, Weak Bisimulations for Coalgebras over Ordered Functors, Proc. IFIP TCS 2012, pp.87-103, 2012.
DOI : 10.1007/978-3-642-33475-7_7

T. Brengos, Weak bisimulations for coalgebras over ordered monads, 2013.
DOI : 10.2168/lmcs-11(2:14)2015
URL : http://arxiv.org/abs/1310.3656

M. Barr, Coequalizers and free triples, Mathematische Zeitschrift, vol.12, issue.4, pp.307-322, 1970.
DOI : 10.1007/BF01111838

N. Ghani and T. Uustalu, Coproducts of Ideal Monads, Theoretical Informatics and Applications, pp.321-342, 2004.
DOI : 10.1051/ita:2004016

R. J. Glabbeek-van, The linear time ??? Branching time spectrum II, Lecture Notes in Computer Science, vol.715, pp.66-81, 1993.
DOI : 10.1007/3-540-57208-2_6

S. Goncharov, Kleene monads, 2010.

S. Goncharov and D. Pattinson, Weak Bisimulation for Monad-Type Coalgebras. (2013) Slides

H. P. Gumm, Elements of the general theory of coalgebras, LUATCS, vol.99, 1999.

M. Hasegawa, Models of Sharing Graphs. A Categorical Semantics of let and letrec, 1997.

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Forward and Backward Simulations, Partly in Japanese) Proc. JSSST Annual Meeting, 2006.
DOI : 10.1007/11817949_27
URL : http://basics.sjtu.edu.cn/~yuehg/concur/generic forward and backward simulations(2006).pdf

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Trace Semantics via Coinduction, Logical Methods in Computer Science, vol.3, issue.4, pp.11-12, 2007.
DOI : 10.2168/LMCS-3(4:11)2007

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2006.
DOI : 10.1145/568438.568455

A. Joyal, R. Street, and D. Verity, Traced monoidal categories, Mathematical Proceedings of the Cambridge Philosophical Society, vol.1488, issue.03, pp.447-468, 1996.
DOI : 10.1007/BF02096491

B. Jacobs, Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems, Electronic Notes in Theoretical Computer Science, vol.203, issue.5, pp.131-152, 2008.
DOI : 10.1016/j.entcs.2008.05.023

B. Jacobs, From Coalgebraic to Monoidal Traces, Electronic Notes in Theoretical Computer Science, vol.264, issue.2, pp.125-140, 2010.
DOI : 10.1016/j.entcs.2010.07.017
URL : http://doi.org/10.1016/j.entcs.2010.07.017

B. Jacobs, A. Silva, and A. Sokolova, Trace Semantics via Determinization, Lecture Notes in Computer Science, vol.7399, pp.109-129, 2012.
DOI : 10.1007/978-3-642-32784-1_7

A. Kock, Strong functors and monoidal monads, Archiv der Mathematik, vol.1, issue.1, pp.113-120, 1972.
DOI : 10.1007/BF01304852

M. Lane and S. , Categories for working mathematician, 1998.
DOI : 10.1007/978-1-4612-9839-7

E. Manes, Algebraic Theories, 1976.
DOI : 10.1007/978-1-4612-9860-1

E. Manes and P. Mulry, Monad Compositions I: General constructions and recursive distributive laws, Theory and Applications of Categories, vol.18, issue.7, pp.172-208, 2007.

M. Miculan and M. Peressotti, Weak bisimulations for labelled transition systems weighted over semirings, p.4106, 1310.

S. Milius, On Iteratable Endofunctors, Electronic Notes in Theoretical Computer Science, vol.69, 2003.
DOI : 10.1016/S1571-0661(04)80570-X
URL : http://doi.org/10.1016/s1571-0661(04)80570-x

R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, Communication and Concurrency, 1989.

U. Montanari and V. Sassone, Dynamic congruence vs. progressing bisimulation for CCS *, Fundamenta Informaticae, vol.16, issue.2, pp.171-199, 1992.

J. Rothe, A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras, Proc. CMCS02, pp.270-285, 2002.
DOI : 10.1016/S1571-0661(04)80368-2

J. Rothe and D. Masulovi´cmasulovi´c, Towards Weak Bisimulation For Coalgebras, Electronic Notes in Theoretical Computer Science, vol.68, issue.1, pp.32-46, 2002.
DOI : 10.1016/S1571-0661(04)80499-7
URL : http://doi.org/10.1016/s1571-0661(04)80499-7

J. Rutten, A note on Coinduction and Weak Bisimilarity for While Programs, Theoretical Informatics and Applications, pp.393-400, 1999.
DOI : 10.1051/ita:1999125

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

D. Sangiorgi, Introduction to Bisimulation and Coinduction, 2011.
DOI : 10.1017/CBO9780511777110
URL : https://hal.archives-ouvertes.fr/hal-00907026

R. Segala and N. Lynch, Probabilistic Simulations for Probabilistic Processes, Proc. CONCUR94, pp.481-496, 1994.
DOI : 10.1007/978-3-540-48654-1_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6430

R. Segala, Modeling and verification of randomized distributed real-time systems, p.MIT, 1995.

A. Silva and B. Westerbaan, A Coalgebraic View of ??-Transitions, Lecture Notes in Computer Science, vol.8089, pp.267-281, 2013.
DOI : 10.1007/978-3-642-40206-7_20

A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten, Generalizing the powerset construction , coalgebraically, Proc. FSTTCS 2010, pp.272-283, 2010.

A. Simpson and G. Plotkin, Complete axioms for categorical fixed-point operators, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.30-41, 2000.
DOI : 10.1109/LICS.2000.855753
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.2886

A. Sokolova, E. De-vink, and H. Woracek, Coalgebraic Weak Bisimulation for Action- Type Systems, Sci. Ann. Comp. Sci, vol.19, pp.93-144, 2009.
DOI : 10.1016/j.entcs.2004.06.050
URL : http://doi.org/10.1016/j.entcs.2004.06.050

S. Staton, Relating coalgebraic notions of bisimulation, Logical Methods in Computer Science, vol.7, issue.1, pp.13-14, 2011.
DOI : 10.2168/lmcs-7(1:13)2011
URL : http://arxiv.org/abs/1101.4223