P. A. Abdulla, K. Cer¯-ans, B. Jonsson, and Y. Tsay, Algorithmic Analysis of Programs with Well Quasi-ordered Domains, Information and Computation, vol.160, issue.1-2, pp.109-127, 2000.
DOI : 10.1006/inco.1999.2843

P. A. Abdulla, A. Bouajjani, and J. , Monotonic and Downward Closed Games, Journal of Logic and Computation, vol.18, issue.1, pp.153-169, 2008.
DOI : 10.1093/logcom/exm062

A. Arnold and M. Latteux, Recursivite et cones rationnels fermes par intersection, Calcolo, vol.18, issue.4, pp.381-39410, 1978.
DOI : 10.5802/aif.287

M. Benedikt, T. Duff, A. Sharad, and J. Worrell, Polynomial automata: Zeroness and applications, LICS 2017, 2017.

M. Blondin, A. Finkel, and P. Mckenzie, Handling Infinitely Branching WSTS, ICALP 2014, pp.13-25, 2014.
DOI : 10.1007/978-3-662-43951-7_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.9970

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

R. Bonnet, A. Finkel, and M. Praveen, Extending the Rackoff technique to affine nets, FSTTCS 2012 of Leibniz Int. Proc. Inf, pp.301-312

L. Bozzelli and P. Ganty, Complexity Analysis of the Backward Coverability Algorithm for VASS, RP 2011, pp.96-109
DOI : 10.1007/978-3-642-24288-5_10

J. Courtois and S. Schmitz, Alternating Vector Addition Systems with States, MFCS 2014, pp.220-231, 2014.
DOI : 10.1007/978-3-662-44522-8_19

URL : https://hal.archives-ouvertes.fr/hal-00980878

. Ph, B. De-groote, S. Guillaume, and . Salvati, Vector addition tree automata, LICS 2004, pp.64-73, 2004.

N. Decker and D. Thoma, On Freeze LTL with Ordered Attributes, FoSSaCS 2016, pp.269-284, 2016.
DOI : 10.1007/978-3-642-15155-2_54

URL : http://arxiv.org/abs/1504.06355

S. Demri, M. Jurdzi´nskijurdzi´nski, O. Lachish, and R. Lazi´clazi´c, The covering and boundedness problems for branching vector addition systems, Journal of Computer and System Sciences, vol.79, issue.1, pp.23-38, 2013.
DOI : 10.1016/j.jcss.2012.04.002

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.256

D. Figueira, S. Figueira, S. Schmitz, and P. Schnoebelen, Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.269-278
DOI : 10.1109/LICS.2011.39

URL : http://arxiv.org/abs/1007.2989

A. Finkel and J. Goubault-larrecq, Forward analysis for WSTS, part I: Completions, STACS 2009 of Leibniz Int. Proc. Inf, pp.433-444
DOI : 10.2168/lmcs-8(3:28)2012

URL : https://hal.archives-ouvertes.fr/inria-00359699

A. Finkel and J. Goubault-larrecq, Forward analysis for WSTS, part II: Complete WSTS, Logic. Meth. in Comput. Sci, vol.83, issue.3, pp.28-29, 2012.
DOI : 10.2168/lmcs-8(3:28)2012

URL : http://arxiv.org/pdf/1208.4549

A. Finkel, . Ph, and . Schnoebelen, Well-structured transition systems everywhere! Theor, Comput. Sci, vol.256, issue.1200, pp.63-9210, 2001.
DOI : 10.1016/s0304-3975(00)00102-x

URL : http://doi.org/10.1016/s0304-3975(00)00102-x

J. Goubault-larrecq and L. Ens-cachan, On a generalization of a result by Valk and Jantzen, 2009.

J. Goubault-larrecq, S. Halfon, P. Karandikar, K. Narayan-kumar, and P. Schnoebelen, The ideal approach to computing closed subsets in well-quasi-orderings

C. Haase, S. Schmitz, and P. Schnoebelen, The power of priority channel systems, Logic. Meth. in Comput. Sci, vol.104, issue.44, pp.1-4, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091086

S. Haddad, P. Schmitz, and . Schnoebelen, The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.355-364, 2012.
DOI : 10.1109/LICS.2012.46

URL : https://hal.archives-ouvertes.fr/hal-00793811

P. Karandikar and S. Schmitz, The Parametric Ordinal-Recursive Complexity of Post Embedding Problems, FoSSaCS 2013, pp.273-288, 2013.
DOI : 10.1007/978-3-642-37075-5_18

URL : https://hal.archives-ouvertes.fr/hal-00793808

J. Kochems and C. L. Ong, Decidable models of recursive asynchronous concurrency

R. Lazi´clazi´c and S. Schmitz, Non-elementary complexities for branching VASS, MELL, and extensions, ACM Trans. Comput. Logic, vol.1620, issue.3, pp.1-30, 2015.

R. Lazi´clazi´c and S. Schmitz, The complexity of coverability in ?-petri nets, LICS 2016, pp.467-476, 2016.

R. Lazi´clazi´c, T. Newcomb, J. Ouaknine, A. W. Roscoe, and J. Worrell, Nets with tokens which carry data, Fund. Inform, vol.88, issue.3, pp.251-274, 2008.

J. Leroux and P. Schnoebelen, On Functions Weakly Computable by Petri Nets and Vector Addition Systems, Lect. Notes in Comput. Sci, vol.8762, pp.190-202, 2014.
DOI : 10.1007/978-3-319-11439-2_15

URL : https://hal.archives-ouvertes.fr/hal-01084971

P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar, Decision problems for propositional linear logic, Ann. Pure App. Logic, vol.56, issue.92, pp.1-3239, 1992.
DOI : 10.1109/fscs.1990.89588

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.8163

R. Lipton, The reachability problem requires exponential space, 1976.

R. Majumdar and Z. Wang, Expand, Enlarge, and Check for Branching Vector Addition Systems, Concur 2013, pp.152-166
DOI : 10.1007/978-3-642-40184-8_12

A. Marcone, Fine analysis of the quasi-orderings on the power set. Order, pp.339-34710, 2001.

C. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-23110, 1978.
DOI : 10.1016/0304-3975(78)90036-1

URL : http://doi.org/10.1016/0304-3975(78)90036-1

F. Rosa-velardo, Ordinal recursive complexity of unordered data nets Also published as Technical Report TR-4-14, Departamento de Sistemas Informáticos y Computación, 2014.
DOI : 10.1016/j.ic.2017.02.002

F. Rosa-velardo and D. De-frutos-escrig, Decidability and complexity of Petri nets with unordered data, Theoretical Computer Science, vol.412, issue.34, pp.4439-4451, 2011.
DOI : 10.1016/j.tcs.2011.05.007

S. Schmitz, On the computational complexity of dominance links in grammatical formalisms, ACL 2010, pp.514-524, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00482396

S. Schmitz, . Ph, and . Schnoebelen, Multiply-Recursive Upper Bounds with Higman?s Lemma, ICALP 2011, pp.441-452
DOI : 10.1006/jsco.1994.1059

URL : http://arxiv.org/abs/1103.4399

S. Schmitz, . Ph, and . Schnoebelen, Algorithmic aspects of WQO theory. Lecture notes, 2012. URL http://cel.archives-ouvertes
URL : https://hal.archives-ouvertes.fr/cel-00727025

. Ph and . Schnoebelen, Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets, MFCS 2010, pp.616-628, 2010.

A. Urquhart, The complexity of decision procedures in relevance logic II, The Journal of Symbolic Logic, vol.24, issue.04, pp.1774-180210, 1999.
DOI : 10.1145/322261.322271

K. N. Verma and J. Goubault-larrecq, Karp-Miller trees for a branching extension of VASS, Disc. Math. Theor. Comput. Sci, vol.7, issue.1, pp.217-230, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00959038