J. Adámek and V. Trnková, Automata and Algebras in Categories, 1990.

J. Adámek, H. P. Gumm, and V. Trnková, Presentation of Set Functors: A Coalgebraic Perspective, Journal of Logic and Computation, vol.20, issue.5, pp.991-1015, 2010.
DOI : 10.1093/logcom/exn090

L. Aceto, A. Ingolfsdottir, and J. Sack, Resource bisimilarity and graded bisimilarity coincide, Information Processing Letters, vol.111, issue.2, pp.68-76, 2010.
DOI : 10.1016/j.ipl.2010.10.019

L. Aceto, A. Ingolfsdottir, P. Levy, and J. Sack, Characteristic formulae for fixed-point semantics: a general framework, Mathematical Structures in Computer Science, vol.969, issue.02, pp.125-173, 2012.
DOI : 10.1016/0890-5401(91)90030-6

A. Baltag, A Logic for Coalgebraic Simulation, Electronic Notes in Theoretical Computer Science, vol.33, pp.42-46, 2000.
DOI : 10.1016/S1571-0661(05)80343-3

M. Barr, Relational algebras, Lecture Notes in Mathematics, vol.47, pp.39-55, 1970.
DOI : 10.1073/pnas.47.7.1043

M. Barr, Terminal coalgebras in well-founded set theory, Theoretical Computer Science, vol.114, issue.2, pp.299-315, 1993.
DOI : 10.1016/0304-3975(93)90076-6

F. Van-breugel, M. Mislove, J. Ouaknine, and J. Worrell, Domain theory, testing and simulation for labelled Markov processes, Theoretical Computer Science, vol.333, issue.1-2, pp.171-197, 2005.
DOI : 10.1016/j.tcs.2004.10.021

F. Corradini, R. De-nicola, and A. Labella, Models of Nondeterministic Regular Expressions, Journal of Computer and System Sciences, vol.59, issue.3, pp.412-449, 1999.
DOI : 10.1006/jcss.1999.1636

H. P. Gumm, From T-Coalgebras to Filter Structures and Transition Systems, CALCO 2005, pp.194-212, 2005.
DOI : 10.1007/11548133_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.5084

J. Hughes and B. Jacobs, Simulations in coalgebra, Theoretical Computer Science, vol.327, issue.1-2, pp.71-108, 2004.
DOI : 10.1016/j.tcs.2004.07.022

A. Kurz and R. , Equational Coalgebraic Logic, Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, pp.333-356, 2009.
DOI : 10.1016/j.entcs.2009.07.097

R. Leal, Predicate Liftings Versus Nabla Modalities, Electronic Notes in Theoretical Computer Science, vol.203, issue.5, pp.195-220, 2008.
DOI : 10.1016/j.entcs.2008.05.026

P. B. Levy, Similarity Quotients as Final Coalgebras, FoSSaCS 2011, pp.27-41, 2011.
DOI : 10.1007/978-3-642-19805-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.8753

J. Marti, Relation liftings in coalgebraic modal logic MSc thesis, 2011.

J. Marti and Y. Venema, Lax Extensions of Coalgebra Functors, In: Coalgebraic Methods in Computer Science Lecture Notes in Computer Science, vol.7399, pp.150-169, 2012.
DOI : 10.1007/978-3-642-32784-1_9

J. Marti and Y. Venema, Lax extensions of coalgebra functors and their logic, Journal of Computer and System Sciences, vol.81, issue.5, 2014.
DOI : 10.1016/j.jcss.2014.12.006

L. Moss, Coalgebraic Logic. Annals of Pure and Applied Logic, pp.277-317, 1999.
DOI : 10.1016/s0168-0072(98)00042-6
URL : http://doi.org/10.1016/s0168-0072(98)00042-6

M. Müller-olm, Derivation of Characteristic Formulae, Electronic Notes in Theoretical Computer Science, vol.18, pp.159-170, 1998.
DOI : 10.1016/S1571-0661(05)80257-9

M. De-rijke, A note on graded modal logic, Studia Logica, vol.64, issue.2, pp.271-283, 2000.
DOI : 10.1023/A:1005245900406

J. Sack and L. Zhang, A General Framework for Probabilistic Characterizing Formulae, VMCAI 2012, pp.396-411, 2012.
DOI : 10.2140/pjm.1955.5.285

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995.
DOI : 10.1007/bfb0015027

A. Thijs, Simulation and Fixpoint Semantics, 1996.

Y. Venema, Automata and fixed point logic: A coalgebraic perspective, Information and Computation, vol.204, issue.4, pp.637-678, 2006.
DOI : 10.1016/j.ic.2005.06.003