P. Aziz-abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar, Computing Simulations over Tree Automata, TACAS, pp.93-108, 2008.
DOI : 10.1007/978-3-540-78800-3_8

P. Aziz-abdulla, Y. Chen, L. Holík, R. Mayr, and T. Vojnar, When Simulation Meets Antichains, Lecture Notes in Computer Science, vol.6015, pp.158-174, 2010.
DOI : 10.1007/978-3-642-12002-2_14

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

S. Crafa, F. Ranzato, and F. Tapparo, Saving Space in a Time Efficient Simulation Algorithm, 2009 Ninth International Conference on Application of Concurrency to System Design, pp.23-42, 2011.
DOI : 10.1109/ACSD.2009.14

R. Gentilini, C. Piazza, and A. Policriti, From bisimulation to simulation: Coarsest partition problems, Journal of Automated Reasoning, vol.31, issue.1, pp.73-103, 2003.
DOI : 10.1023/A:1027328830731
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3303

M. Rauch-henzinger, T. A. Henzinger, and P. W. Kopke, Computing simulations on finite and infinite graphs, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.453-462, 1995.
DOI : 10.1109/SFCS.1995.492576

R. Milner, An Algebraic Definition of Simulation Between Programs, IJCAI, pp.481-489, 1971.

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

F. Ranzato and F. Tapparo, An efficient simulation algorithm based on abstract interpretation, Information and Computation, vol.208, issue.1, pp.1-22, 2010.
DOI : 10.1016/j.ic.2009.06.002

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

R. J. Van-glabbeek and B. Ploeger, Correcting a Space-Efficient Simulation Algorithm, Lecture Notes in Computer Science, vol.5123, pp.517-529, 2008.
DOI : 10.1007/978-3-540-70545-1_49