P. Abdulla, B. Jonsson, P. Mahata, and J. , Regular Tree Model Checking, CAV, pp.452-466, 2002.
DOI : 10.1007/3-540-45657-0_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7184

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

P. A. Abdulla, B. Jonsson, M. Nilsson, and J. , Algorithmic Improvements in Regular Model Checking, CAV, pp.236-248, 2003.
DOI : 10.1007/978-3-540-45069-6_25

C. Baier, J. P. Katoen, and I. Ebrary, Principles of model checking, 2008.

A. Bauer and Y. Falcone, Decentralised LTL monitoring, LNCS, vol.7436, pp.85-100, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00857286

Y. Boichut, R. Courbis, P. Héam, and O. Kouchnarenko, Finer Is Better: Abstraction Refinement for Rewriting Approximations, LNCS, vol.5117, pp.48-62, 2008.
DOI : 10.1007/978-3-540-70590-1_4
URL : https://hal.archives-ouvertes.fr/hal-00563422

B. Boigelot, Domain-specific regular acceleration, International Journal on Software Tools for Technology Transfer, vol.10, issue.3, pp.193-206, 2012.
DOI : 10.1007/s10009-011-0206-x

B. Boigelot, A. Legay, and P. Wolper, Iterating Transducers in the Large, CAV, pp.223-235, 2003.
DOI : 10.1007/978-3-540-45069-6_24

F. Bonchi and D. Pous, Checking NFA equivalence with bisimulations up to congruence, p.13, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00639716

A. Bouajjani, P. Habermehl, and T. Vojnar, Abstract Regular Model Checking, CAV, pp.378-379, 2004.
DOI : 10.1007/978-3-540-27813-9_29
URL : https://hal.archives-ouvertes.fr/hal-00159512

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, CAV, pp.403-418, 2000.
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512

A. Bouajjani and T. Touili, Widening techniques for regular tree model checking. STTT, pp.1-21, 2011.

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement, LNCS, vol.1855, pp.154-169, 2000.
DOI : 10.1109/time.2003.1214874
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.407

E. M. Clarke, O. Grumberg, and D. Peled, Model Checking, 2000.

D. Dams, Y. Lakhnech, and M. Steffen, Iterating transducers, CAV, pp.286-297, 2001.

D. Dams, Y. Lakhnech, and M. Steffen, Iterating transducers, Journal of Logic and Algebraic Programming, vol.52, pp.109-127, 2002.

L. Doyen and J. Raskin, Antichain Algorithms for Finite Automata, pp.2-22
DOI : 10.1007/978-3-642-12002-2_2

F. Fioravanti, A. Pettorossi, M. Proietti, and V. Senni, Program specialization for verifying infinite state systems: An experimental evaluation. Logic-Based Program Synthesis and Transformation, pp.164-183, 2011.

T. , L. Gall, and B. Jeannet, Lattice automata: A representation for languages on infinite alphabets, and some applications to verification, SAS, pp.52-68, 2007.

A. Cano-gómez, G. Guaiana, and J. Pin, When does partial commutative closure preserve regularity?, LNCS, vol.5126, issue.2, pp.209-220, 2008.

B. Jonsson and M. Nilsson, Transitive Closures of Regular Relations for Verifying Infinite-State Systems, TACAS, pp.220-235, 2000.
DOI : 10.1007/3-540-46419-0_16

Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar, Symbolic model checking with rich assertional languages, CAV, pp.424-435, 1997.
DOI : 10.1016/S0304-3975(00)00103-1

A. Legay, Extrapolating (omega-)regular model checking, International Journal on Software Tools for Technology Transfer, vol.3, issue.4, pp.119-143, 2012.
DOI : 10.1007/s10009-011-0209-7

T. Touili, Regular Model Checking using Widening Techniques, VEPAS, pp.342-356, 2001.
DOI : 10.1016/S1571-0661(04)00187-2
URL : https://hal.archives-ouvertes.fr/hal-00161116

F. Yu, T. Bultan, and O. Ibarra, Relational string verification using multi-track automata, IJFCS, vol.22, pp.290-299, 2011.