P. A. Abdulla, Y. Chen, L. Clemente, L. Holík, C. D. Hong et al., Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing, Proc. of CAV'10, 2010.

P. A. Abdulla, Y. Chen, L. Clemente, L. Holík, C. D. Hong et al., Advanced Ramsey-based Büchi Automata Inclusion Testing, 2011.
DOI : 10.1007/978-3-642-23217-6_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.9703

P. A. Abdulla, Y. Chen, L. Holík, R. Mayr, and T. Vojnar, When Simulation Meets Antichains, Proc. of TACAS'10, 2010.
DOI : 10.1007/978-3-642-12002-2_14
URL : https://hal.archives-ouvertes.fr/inria-00460294

D. Dill, A. Hu, and H. Wong-toi, Checking for language inclusion using simulation preorders, Proc. of CAV'92, 1992.
DOI : 10.1007/3-540-55179-4_25

L. Doyen and J. Raskin, Improved Algorithms for the Automata-Based Approach to Model-Checking, Proc. of TACAS'07, 2007.
DOI : 10.1007/978-3-540-71209-1_34

K. Etessami, A Hierarchy of Polynomial-Time Computable Simulations for Automata, Proc. of CONCUR'02, 2002.
DOI : 10.1007/3-540-45694-5_10

K. Etessami, T. Wilke, and R. A. Schuller, Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata, SIAM J. Comp, vol.34, issue.5, 2005.
DOI : 10.1007/3-540-48224-5_57
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.9079

S. Fogarty, Büchi Containment and Size-Change Termination, 2008.
DOI : 10.2168/lmcs-8(1:13)2012
URL : http://dx.doi.org/10.2168/lmcs-8(1:13)2012

S. Fogarty and M. Y. Vardi, Büchi Complementation and Size-Change Termination, Proc. of TACAS'09, 2009.
DOI : 10.1007/978-3-642-00768-2_2
URL : http://arxiv.org/abs/1110.6183

S. Fogarty and M. Y. Vardi, Efficient Büchi Universality Checking, Proc. of TACAS'10, 2010.
DOI : 10.1007/978-3-642-12002-2_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.3660

M. R. Henzinger, T. A. Henzinger, and P. W. Kopke, Computing simulations on finite and infinite graphs, Proceedings of IEEE 36th Annual Foundations of Computer Science, 1995.
DOI : 10.1109/SFCS.1995.492576
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.3591

N. D. Jones, C. S. Lee, and A. M. Ben-amram, The Size-Change Principle for Program Termination, Proc. of POPL'01. ACM SIGPLAN, 2001.

O. Kupferman and M. Y. Vardi, Verification of fair transition systems, Proc. of CAV'96, 1996.
DOI : 10.1007/3-540-61474-5_84

O. Kupferman and M. Y. Vardi, Weak alternating automata are not that weak, ACM Transactions on Computational Logic, vol.2, issue.3, pp.408-437, 2001.
DOI : 10.1145/377978.377993
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.961

R. Pelánek, BEEM: Benchmarks for Explicit Model Checkers, Proc. of SPIN'07, 2007.
DOI : 10.1007/978-3-540-73370-6_17

A. P. Sistla, M. Y. Vardi, and P. Wolper, The Complementation Problem for Büchi Automata with Applications to Temporal Logic, Proc. of ICALP'85, 1985.

F. Somenzi and R. Bloem, Efficient Büchi Automata from LTL Formulae, Proc. of CAV'00, 2000.
DOI : 10.1007/10722167_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9752

D. Tabakov and M. Y. Vardi, Model Checking Büchi Specifications, Proc. of LATA'07, 2007.

M. Y. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification, Proc. of LICS'86, 1986.
DOI : 10.1007/3-540-50403-6_33

M. D. Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata, Proc. of CAV'06, 2006.
DOI : 10.1007/11817963_5