L. Aceto and M. Hennessy, Termination, deadlock, and divergence, J. ACM, vol.39, pp.147-187, 1992.

L. Aceto, A. Ingólfsdóttir, K. Larsen, and J. Srba, Reactive systems: modelling, specification and verification, 2007.

J. Adámek and V. Trnková, Automata and Algebras in Categories, Mathematics and its Applications, vol.37, 1990.

F. Baader, S. Brandt, and C. Lutz, Pushing the EL envelope, International Joint Conference on Artificial Intelligence, IJCAI 2005, 2005.

M. Barr, Relational algebras, Proc. Midwest Category Seminar. LNM, vol.137, 1970.

H. Beki?, Definable operations in general algebras, and the theory of automata and flowcharts, Programming Languages and Their Definition-Hans Bekic, pp.30-55, 1984.

J. Bradfield and C. Stirling, Modal logics and mu-calculi, Handbook of Process Algebra, pp.293-332, 2001.

C. Cîrstea, C. Kupke, and D. Pattinson, EXPTIME tableaux for the coalgebraic mu-calculus, Log. Meth. Comput. Sci, vol.7, 2011.

C. Cîrstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema, Modal logics are coalgebraic, Comput. J, vol.54, pp.31-41, 2011.

J. Godskesen, A. Ingólfsdóttir, and M. Zeeberg, Fra Hennessy-Milner logik til CCSprocesser. Master's thesis, 1987.

S. Goncharov, S. Milius, and A. Silva, Towards a coalgebraic Chomsky hierarchy (extended abstract), Theoretical Computer Science, IFIP TCS 2014, vol.8705, pp.265-280, 2014.

D. Gorín and L. Schröder, Simulations and bisimulations for coalgebraic modal logics, Algebra and Coalgebra in Computer Science, CALCO 2013, vol.8089, pp.253-266, 2013.

D. Gorín and L. Schröder, Subsumption checking in conjunctive coalgebraic fixpoint logics, Advances in Modal Logic, AiML, pp.254-273, 2014.

S. Graf and J. Sifakis, A modal characterization of observational congruence on finite terms of CCS, Inf. Control, vol.68, pp.125-145, 1986.

H. P. Gumm and T. Schröder, Monoid-labeled transition systems, Coalgebraic Methods in Computer Science, vol.44, pp.185-204, 2001.

D. Kozen, Results on the propositional µ-calculus, Theor. Comput. Sci, vol.27, pp.333-354, 1983.

D. Kozen, Kleene algebra with tests, ACM Trans. Prog. Lang. Syst, vol.19, pp.427-443, 1997.

A. Kurz and R. Leal, Equational coalgebraic logic, Mathematical Foundations of Programming Semantics, vol.249, pp.333-356, 2009.

R. Leal, Predicate liftings versus nabla modalities, Coalgebraic Methods in Computer Science, CMCS 2008. ENTCS, vol.203, pp.195-220, 2008.

J. Marti and Y. Venema, Lax extensions of coalgebra functors and their logic, J. Comput. Syst. Sci, vol.81, issue.5, pp.880-900, 2015.

S. Milius, A sound and complete calculus for finite stream circuits, Proc. 25th Annual Symposium on Logic in Computer Science (LICS 2010), pp.449-458, 2010.

S. Milius, D. Pattinson, and L. Schröder, Generic trace semantics and graded monads, Coalgebraic and Algebraic Methods in Computer Science, CALCO 2015. LIPIcs, vol.35, pp.253-269, 2015.

E. Moggi, Notions of computation and monads, Inf. Comput, vol.93, issue.1, pp.55-92, 1991.

L. Moss, Coalgebraic logic, Ann. Pure Appl. Log, vol.96, pp.277-317, 1999.

R. Myers, Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs, 2013.

R. Parikh, Propositional game logic, Foundations of Computer Science, FOCS 1983, 1983.

D. Pattinson, Coalgebraic modal logic: Soundness, completeness and decidability of local consequence, Theor. Comput. Sci, vol.309, pp.177-193, 2003.

D. Pattinson, Expressive logics for coalgebras via terminal sequence induction, Notre Dame J. Formal Log, vol.45, pp.19-33, 2004.

D. Peleg, Concurrent dynamic logic, J. ACM, vol.34, pp.450-479, 1987.

L. Schröder, Expressivity of coalgebraic modal logic: The limits and beyond, Theor. Comput. Sci, vol.390, pp.230-247, 2008.

L. Schröder and Y. Venema, Completeness of flat coalgebraic fixpoint logics, ACM Trans. Comput. Log, vol.19, pp.1-4, 2018.

A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten, Quantitative Kleene coalgebras, Inf. Comput, vol.209, pp.822-849, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00777557

A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten, Generalizing determinization from automata to coalgebras, Log. Meth. Comput. Sci, vol.9, issue.9, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909339

A. Silva, M. Bonsangue, and J. Rutten, Non-deterministic Kleene coalgebras, Log. Meth. Comput. Sci, vol.6, issue.3, 2010.

B. Steffen and A. Ingólfsdóttir, Characteristic formulae for processes with divergence, Inf. Comput, vol.110, pp.149-163, 1994.

V. Strassen, The existence of probability measures with given marginals, Ann Math. Stat, vol.36, pp.423-439, 1965.

V. Trnková, General theory of relational automata, Fund. Inform, vol.3, pp.189-234, 1980.

Y. Venema, Automata and fixed point logic: A coalgebraic perspective, Inf. Comput, vol.204, pp.637-678, 2006.

H. J. Weinert, On 0-simple semirings, semigroup semirings, and two kinds of division semirings, Semigroup Forum, vol.28, pp.313-333, 1984.