A. Abdulla, A. Collomb-annichini, A. Bouajjani, and B. Jonsson, Using Forward Reachability Analysis for Verification of Lossy Channel Systems, Formal Methods in System Design, vol.25, issue.1, pp.39-65, 2004.
DOI : 10.1023/B:FORM.0000033962.51898.1a

. Almeida, Some algorithmic problems for pseudovarieties, Publ. Math. Debrecen, pp.54531-552, 1999.

M. Almeida and . Zeitoun, The pseudovariety $J$ is hyperdecidable, RAIRO - Theoretical Informatics and Applications, vol.31, issue.5, pp.457-482, 1997.
DOI : 10.1051/ita/1997310504571

V. V. Atminas and . Lozin, Labelled induced subgraphs and well-quasi-ordering. Order, pp.313-328, 2014.

A. Atserias, M. Dawar, and . Grohe, Preservation under Extensions on Well-Behaved Finite Structures, SIAM Journal on Computing, vol.38, issue.4, pp.1364-1381, 2008.
DOI : 10.1137/060658709

D. A. Bachmair and . Plaisted, Termination orderings for associative-commutative rewriting systems, Journal of Symbolic Computation, vol.1, issue.4, pp.329-349, 1985.
DOI : 10.1016/S0747-7171(85)80019-5

L. Boja?czyk, H. Segoufin, and . Straubing, Piecewise testable tree languages, Logical Methods in Computer Science, vol.8, issue.3, pp.26-2012
DOI : 10.2168/LMCS-8(3:26)2012

. Bonnet, On the cardinality of the set of initial intervals of a partially ordered set In Infinite and finite sets: to Paul Erd?s on his 60th birthday, pp.189-198, 1975.

P. Clemente, S. Parys, I. Salvati, and . Walukiewicz, The diagonal problem for higherorder recursion schemes is decidable, LICS 2016, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01394830

M. Comon, R. Dauchet, C. Gilleron, F. Löding, D. Jacquemard et al., Tree Automata Techniques and Applications, 2007.

. Courcelle, On constructing obstruction sets of words, Bull. EATCS, vol.44, pp.178-186, 1991.

W. Czerwi?ski, T. Martens, and . Masopust, Efficient Separability of Regular Languages by Subsequences and Suffixes, ICALP 2013, pp.150-161, 2013.
DOI : 10.1007/978-3-642-39212-2_16

W. Czerwi?ski, L. Martens, M. Van-rooijen, G. Zeitoun, and . Zetzsche, A characterization for decidable separability by piecewise testable languages. Preprint, 2015. URL http://arxiv.org/abs/1410.1042v2. An extended abstract appeared as Zeitoun. A note on decidable separability by piecewise testable languages, FCT 2015, pp.173-185, 2015.

. Ding, Subgraphs and well-quasi-ordering, Journal of Graph Theory, vol.2, issue.5, pp.489-502, 1992.
DOI : 10.1002/jgt.3190160509

. Duris, Extension Preservation Theorems on Classes of Acyclic Finite Structures, SIAM Journal on Computing, vol.39, issue.8, pp.3670-3681, 2010.
DOI : 10.1137/080744463

J. Finkel and . Goubault-larrecq, Forward analysis for WSTS, part I: Completions, STACS 2009 of Leibniz Int. Proc. Inf, pp.433-444, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359699

J. Finkel and . Goubault-larrecq, Forward analysis for WSTS, part II: Complete WSTS, Logic. Meth. in Comput. Sci, vol.8, issue.3, pp.28-2012

P. Goubault-larrecq, K. Karandikar, P. Narayan-kumar, L. Schnoebelen, and . Ens-cachan, The ideal approach to computing closed subsets in well-quasi-orderings In preparation, 2016. See also an earlier version in: J. Goubault-Larrecq. On a generalization of a result by Valk and Jantzen, 2009.

. Gupta, A constructive proof that tree are well-quasi-ordered under minors (detailed abstract), LFCS 1992, pp.174-185, 1992.
DOI : 10.1007/BFb0023872

R. Habermehl, H. Meyer, and . Wimmel, The Downward-Closure of Petri Net Languages, ICALP 2010, pp.466-477, 2010.
DOI : 10.1007/978-3-642-14162-1_39

J. Hague, C. L. Kochems, and . Ong, Unboundedness and downward closures of higher-order pushdown automata, POPL 2016, pp.151-163, 2016.

L. Harwath, N. Heimberg, and . Schweikardt, Preservation and decomposition theorems for bounded degree structures, Logic. Meth. in Comput. Sci, vol.11, issue.4, pp.17-2015

. Higman, Ordering by Divisibility in Abstract Algebras, Proceedings of the London Mathematical Society, vol.3, issue.1, pp.326-336, 1952.
DOI : 10.1112/plms/s3-2.1.326

. Jullien, Contribution à l'étude des types d'ordres dispersés, Thèse de doctorat, 1969.

S. Lazi? and . Schmitz, The Ideal View on Rackoff???s Coverability Technique, RP 2015, pp.1-13, 2015.
DOI : 10.1007/978-3-319-24537-9_8

S. Leroux and . Schmitz, Demystifying Reachability in Vector Addition Systems, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.56-67, 2015.
DOI : 10.1109/LICS.2015.16
URL : https://hal.archives-ouvertes.fr/hal-01168388

. J. St and . Nash-williams, On well-quasi-ordering finite trees, Math. Proc. Cambridge Philos. Soc, vol.59, issue.4, pp.833-835, 1963.

N. Padon, S. Immerman, A. Shoham, M. Karbyshev, and . Sagiv, Decidability of inferring inductive invariants, POPL 2016, pp.217-231, 2016.

. Place, Characterization of Logics over Ranked Tree Languages, Lect. Notes in Comput. Sci, vol.5213, pp.401-415, 2008.
DOI : 10.1007/978-3-540-87531-4_29

M. Place and . Zeitoun, Automata column: The tale of the quantifier alternation hierarchy of first-order logic over words, pp.4-17, 2015.

L. Place, M. Van-rooijen, and . Zeitoun, Separating Regular Languages by Piecewise Testable and Unambiguous Languages, MFCS 2013, pp.729-740, 2013.
DOI : 10.1007/978-3-642-40313-2_64
URL : https://hal.archives-ouvertes.fr/hal-00948943

B. Sankaran, S. Adsul, and . Chakraborty, A Generalization of the ??o??-Tarski Preservation Theorem over Classes of Finite Structures, MFCS 2014, pp.474-485, 2014.
DOI : 10.1007/978-3-662-44522-8_40

. Simon, Piecewise testable events, Automata Theory and Formal Languages, pp.214-222, 1975.
DOI : 10.1007/3-540-07407-4_23

G. Szymanski and J. H. Williams, Noncanonical Extensions of Bottom-Up Parsing Techniques, SIAM Journal on Computing, vol.5, issue.2, pp.231-250, 1976.
DOI : 10.1137/0205019

W. Tait, A counterexample to a conjecture of Scott and Suppes, The Journal of Symbolic Logic, vol.57, issue.01, pp.15-16, 1959.
DOI : 10.2307/2964569

J. Van-leeuwen, Effective constructions in well-partially- ordered free monoids, Discrete Mathematics, vol.21, issue.3, pp.237-252, 1978.
DOI : 10.1016/0012-365X(78)90156-5

. Zetzsche, An Approach to Computing Downward Closures, ICALP 2015, pp.440-451, 2015.
DOI : 10.1007/978-3-662-47666-6_35