1. Lecture Notes in Computer Science;P.A. Abdulla,2008
2. Cécé, G.: Three simulation algorithms for labelled transition systems. Preprint cs.arXiv:1301.1638, arXiv.org (2013)
3. Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: coarsest partition problems. J. Automated Reasoning 31(1), 73–103 (2003)
4. Lecture Notes in Computer Science;R. Glabbeek van,2008
5. Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. 36th IEEE FOCS, pp. 453–462 (1995)