J. Adámek, F. Bonchi, M. Hülsbusch, B. König, S. Milius et al., A Coalgebraic Perspective on Minimization and Determinization, Foundations of Software Science and Computational Structures, pp.58-73, 2012.
DOI : 10.1007/978-3-642-28729-9_4

S. Awodey, Category Theory, 2006.
DOI : 10.1093/acprof:oso/9780198568612.001.0001

N. Bezhanishvili, C. Kupke, and P. Panangaden, Minimization via Duality, Proc. of WoLLIC '12, pp.191-205, 2012.
DOI : 10.1007/978-3-642-32621-9_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

F. Bonchi, M. Bonsangue, J. Rutten, and A. Silva, Brzozowski???s Algorithm (Co)Algebraically, LNCS, vol.7230, pp.12-23, 2012.
DOI : 10.1007/978-3-642-29485-3_2

F. Bonchi and D. Pous, Checking NFA equivalence with bisimulations up to congruence, Proc. of POPL '13, pp.457-468, 2013.
DOI : 10.1145/2429069.2429124

URL : https://hal.archives-ouvertes.fr/hal-00639716

J. Brzozowski and H. Tamm, Theory of átomata, Proc. of DLT '11, pp.105-116, 2011.

M. Fiore and D. Turi, Semantics of name and value passing, Proc. of LICS '01, pp.93-104, 2001.

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

URL : http://arxiv.org/abs/0710.2505

C. Hermida and B. Jacobs, Structural Induction and Coinduction in a Fibrational Setting, Information and Computation, vol.145, issue.2, pp.107-152, 1998.
DOI : 10.1006/inco.1998.2725

B. Jacobs and J. Rutten, A tutorial on (co)algebras and (co)induction, Bulletin of the European Association for Theoretical Computer Science, vol.62, pp.222-259, 1997.

B. Jacobs, A. Silva, and A. Sokolova, Trace semantics via determinization, Proc. of CMCS '12, pp.109-129, 2012.
DOI : 10.1007/978-3-642-32784-1_7

G. Kelly and R. Street, Review of the elements of 2-categories, Lecture Notes in Mathematics, vol.3, pp.75-103, 1974.
DOI : 10.1016/0022-4049(72)90019-9

H. Kerstan and B. König, Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems, Logical Methods in Computer Science, vol.9, issue.4, pp.16-834, 2013.
DOI : 10.2168/LMCS-9(4:16)2013

M. Lane and S. , Categories for the Working Mathematician, 1998.
DOI : 10.1007/978-1-4612-9839-7

P. Panangaden, Labelled Markov Processes, 2009.
DOI : 10.1142/p595

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

A. Silva, F. Bonchi, M. M. Bonsangue, and J. J. Rutten, Generalizing determinization from automata to coalgebras, Logical Methods in Computer Science, vol.9, issue.1, p.9, 2013.
DOI : 10.2168/LMCS-9(1:9)2013

URL : https://hal.archives-ouvertes.fr/hal-00909339

A. Sokolova, Probabilistic systems coalgebraically: A survey, CMCS Tenth Anniversary Meeting, pp.5095-5110, 2011.
DOI : 10.1016/j.tcs.2011.05.008