M. Béal and M. Crochemore, Minimizing incomplete automata, Finite-State Methods and Natural Language Processing Joint Research Center, pp.9-16, 2008.

G. Cécé, Three Simulation Algorithms for Labelled Transition Systems

G. Cécé and A. Giorgetti, Simulations over Two-Dimensional On-Line Tessellation Automata, Developments in Language Theory, pp.141-152, 2011.
DOI : 10.1007/978-3-642-22321-1_13

E. M. Clarke and E. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Logic of Programs, pp.52-71, 1981.
DOI : 10.1007/BFb0025774

J. Fernandez, An implementation of an efficient algorithm for bisimulation equivalence, Science of Computer Programming, vol.13, issue.2-3, pp.219-236, 1990.
DOI : 10.1016/0167-6423(90)90071-K

O. Grumberg and D. E. Long, Model checking and modular verification, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.843-871, 1994.
DOI : 10.1145/177492.177725
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.6959

J. E. Hopcroft, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1

T. Knuutila, Re-describing an algorithm by Hopcroft, Theoretical Computer Science, vol.250, issue.1-2, pp.333-363, 2001.
DOI : 10.1016/S0304-3975(99)00150-4

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

A. Valmari, Bisimilarity Minimization in O(m logn) Time, Petri Nets, pp.123-142, 2009.
DOI : 10.1137/0216062

A. Valmari and P. Lehtinen, Efficient minimization of dfas with partial transition, STACS, volume 1 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.645-656, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00255954