P. Abdulla, A. Bouajjani, L. Holík, L. Kaati, and T. Vojnar, Computing Simulations over TA: Efficient Techniques for Reducing TA, Proc. of TACAS'08, 2008.

P. Abdulla, Y. Chen, L. Holík, and T. Vojnar, Mediating for Reduction (On Minimizing Alternating B ¨ uchi Automata), 2009.

P. Abdulla, L. Holík, L. Kaati, and T. Vojnar, A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, Electronic Notes in Theoretical Computer Science, vol.251, issue.251, pp.27-48, 2009.
DOI : 10.1016/j.entcs.2009.08.026

A. Farzan, Y. Chen, E. Clarke, Y. Tsay, and B. Wang, Extending??Automated??Compositional??Verification to the Full Class of Omega-Regular Languages, Proc. of TACAS'08, 2008.
DOI : 10.1007/978-3-540-78800-3_2

C. Fritz and T. Wilke, State Space Reductions for Alternating B ¨ uchi Automata: Quotienting by Simulation Equivalences, Proc. of FSTTCS'02, 2002.

C. Fritz and T. Wilke, Simulation relations for alternating B??chi automata, Theoretical Computer Science, vol.338, issue.1-3, pp.275-314, 2005.
DOI : 10.1016/j.tcs.2005.01.016

P. Gastin and D. Oddoux, Fast LTL to B ¨ uchi Automata Translations, Proc. of CAV'01, 2001.

S. Gurumurthy, O. Kupferman, F. Somenzi, and M. Vardi, On Complementing Nondeterministic B ¨ uchi Automata, Proc. of CHARME'03, 2003.

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

F. Somenzi and R. Bloem, Efficient B ¨ uchi Automata from LTL Formulae, Proc. of CAV'00, 2000.

M. Vardi, Automata-theoretic Model Checking Revisited, Proc. of VMCAI'07, 2007.