P. A. Abdulla and B. Jonsson, Verifying Programs with Unreliable Channels, Information and Computation, vol.127, issue.2, pp.91-101, 1996.
DOI : 10.1006/inco.1996.0053

URL : https://doi.org/10.1006/inco.1996.0053

P. A. Abdulla, K. ?er?ns, B. Jonsson, and Y. K. Tsay, Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, pp.109-127, 2000.

P. A. Abdulla, Abstract, Bulletin of Symbolic Logic, vol.2, issue.04, pp.457-515, 2010.
DOI : 10.2307/2370405

P. A. Abdulla, R. Mayr, A. Sangnier, and J. Sproston, Solving Parity Games on Integer Vectors, Proceedings of Concur 2013, pp.106-12010, 2013.
DOI : 10.1007/978-3-642-40184-8_9

URL : http://user.it.uu.se/~parosh/publications/papers/concur2013.pdf

S. Abriola, S. Figueira, and G. Senno, Linearizing well quasi-orders and bounding the length of bad sequences, Theoretical Computer Science, vol.603, pp.3-22, 2015.
DOI : 10.1016/j.tcs.2015.07.012

N. Alechina, N. Bulling, S. Demri, L. , and B. , On the Complexity of Resource-Bounded Logics, Proceedings of RP 2016, pp.36-5010, 2016.
DOI : 10.1007/978-3-319-24953-7_27

C. Alias, A. Darte, P. Feautrier, and L. Gonnord, Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs, Proceedings of SAS 2010, pp.117-133, 2010.
DOI : 10.1007/978-3-642-15769-1_8

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

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.12694, issue.2, pp.183-235, 1994.

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

M. F. Atig and P. Habermehl, On Yen's path logic for Petri nets, International Journal of Fundations of Computer Science, vol.22, issue.4, pp.783-799, 2011.

S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992.
DOI : 10.1515/9781400858927

A. M. Ben-amram, General Size-Change Termination and Lexicographic Descent, Lecture Notes in Computer Science, vol.2566, pp.3-17, 2002.
DOI : 10.1007/3-540-36377-7_1

URL : http://www2.mta.ac.il/~amirben/downloadable/lo.ps.gz

A. M. Ben-amram and L. Kristiansen, ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS, International Journal of Foundations of Computer Science, vol.17, issue.07, pp.1451-1464, 2012.
DOI : 10.1145/361002.361016

A. M. Ben-amram and S. Genaim, Ranking functions for linear-constraint loops:26), Journal of the ACM, vol.61, issue.4, 2014.

M. Benedikt, T. Duff, A. Sharad, and J. B. Worrell, Polynomial automata: Zeroness and applications, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.
DOI : 10.1109/LICS.2017.8005101

N. Bertrand and P. Schnoebelen, Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, pp.233-267, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00906826

K. Bimbó, The decidability of the intensional fragment of classical linear logic, Theoretical Computer Science, vol.597, pp.1-17, 2015.
DOI : 10.1016/j.tcs.2015.06.019

A. Blass and Y. Gurevich, Program termination and well partial orderings, ACM Transactions on Computational Logic, vol.9, issue.3, pp.31-76, 2008.
DOI : 10.1145/1352582.1352586

M. Blondin, A. Finkel, S. Göller, C. Haase, M. et al., Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.32-43, 2015.
DOI : 10.1109/LICS.2015.14

M. Blondin, A. Finkel, and J. Goubault-larrecq, Forward analysis for WSTS, part III: Karp-Miller trees, Proceedings of FSTTCS 2017, Leibniz International Proceedings in Informatics. LZI, 2017.

M. Blondin, A. Finkel, C. Haase, and S. Haddad, The Logical View on Continuous Petri Nets, ACM Transactions on Computational Logic, vol.18, issue.3, pp.241-269, 2017.
DOI : 10.1007/11532231_25

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

M. Blondin, A. Finkel, M. , and P. , Well behaved transition systems, Logical Methods in Computer Science, vol.133, issue.3, pp.241-260, 2017.

M. Boja?czyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data words, ACM Transactions on Computational Logic, vol.12, issue.4, pp.271-297, 2011.
DOI : 10.1145/1970398.1970403

M. Boja?czyk, Some open problems in automata and logic, ACM SIGLOG News, vol.1, issue.2, pp.3-12, 2014.

G. Bonfante, A. E. Cicho?, J. Y. Marion, and H. Touzet, Algorithms with polynomial interpretation termination proof, Journal of Functional Programming, vol.11, issue.1, pp.33-53, 2001.
DOI : 10.1017/S0956796800003877

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

R. 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.

R. Bonnet and . Ens-cachan, Theory of Well-Structured Transition Systems and Extended Vector- Addition Systems, Thèse de doctorat, pp.65-67, 2013.

A. Bouajjani and M. Emmi, Analysis of Recursively Parallel Programs, ACM Transactions on Programming Languages and Systems, vol.35, issue.3, pp.1-49, 2013.
DOI : 10.1145/2518188

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

T. Brázdil, P. Jan?ar, and A. Ku?era, Reachability Games on Extended Vector Addition Systems with States, Proceedings of ICALP 2010, pp.478-489, 2010.
DOI : 10.1007/978-3-642-14162-1_40

T. Brázdil, K. Chatterjee, A. Ku?era, P. Novotn?, and D. Velan, Efficient algorithms for checking fast termination in VASS, 2017.

D. Bresolin, D. Monica, D. Montanari, A. Sala, P. Sciavicco et al., Interval temporal logics over finite linear orders: The complete picture, Proceedings of ECAI 2012, pp.199-204, 2012.

M. Brockschmidt, B. Cook, S. Ishtiaq, H. Khlaaf, and N. Piterman, T2: Temporal Property Verification, Proceedings of TACAS 2016, pp.387-39310, 2016.
DOI : 10.1007/978-3-662-49674-9_22

W. Buchholz, E. A. Cicho?, and A. Weiermann, A Uniform Approach to Fundamental Sequences and Hierarchies, Mathematical Logic Quarterly, vol.234, issue.2, pp.273-286, 1994.
DOI : 10.1090/S0002-9947-1977-0498045-0

W. Buchholz, Proof-theoretic analysis of termination proofs Annals of Pure and Applied Logic, pp.57-65, 1995.

P. Chambart and P. Schnoebelen, The Ordinal Recursive Complexity of Lossy Channel Systems, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.205-216, 2008.
DOI : 10.1109/LICS.2008.47

E. A. Cicho?, Termination orderings and complexity characterisations, Proof Theory, pp.171-194, 1993.
DOI : 10.1017/CBO9780511896262.008

E. A. Cicho?, T. Bittar, and E. , Ordinal recursive bounds for Higman's theorem, Theoretical Computer Science, vol.201, issue.1-2, pp.63-84, 1998.
DOI : 10.1016/S0304-3975(97)00009-1

P. Clote, On the finite containment problem for Petri nets, Theoretical Computer Science, vol.43, issue.86, pp.99-10590169, 1986.
DOI : 10.1016/0304-3975(86)90169-6

T. Colcombet, L. Daviaud, and F. Zuleger, Size-Change Abstraction and Max-Plus Automata, Proceedings of MFCS 2014, pp.208-21910, 2014.
DOI : 10.1007/978-3-662-44522-8_18

URL : http://www.liafa.univ-paris-diderot.fr/%7Ecolcombe/Publications/MFCS14-colcombet-daviaud-zuleger.pdf

B. Cook, A. Podelski, and A. Rybalchenko, Termination proofs for systems code, Proceedings of PLDI 2006, 2006.
DOI : 10.1145/1133255.1134029

B. Cook, A. See, and F. Zuleger, Ramsey vs. Lexicographic Termination Proving, Proceedings of TACAS 2013, pp.47-6110, 2013.
DOI : 10.1007/978-3-642-36742-7_4

C. Cotton-barratt, A. Murawski, and L. Ong, ML and Extended Branching VASS, Proceedings of ESOP 2017, pp.314-34010, 2017.
DOI : 10.1007/978-3-642-31585-5_30

N. Courant and C. Urban, Precise Widening Operators for Proving Termination by Abstract Interpretation, Proceedings of TACAS 2017, pp.136-152, 2017.
DOI : 10.1007/978-3-319-10936-7_19

S. Crespi-reghizzi and D. Mandrioli, Petri nets and szilard languages, Information and Control, vol.33, issue.2, pp.177-192, 1977.
DOI : 10.1016/S0019-9958(77)90558-7

N. Decker, P. Habermehl, M. Leucker, and D. Thoma, Ordered Navigation on Multi-attributed Data??Words, Proceedings of Concur 2014, pp.497-51110, 2014.
DOI : 10.1007/978-3-662-44584-6_34

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

. De-groote, . Ph, B. Guillaume, and S. Salvati, Vector addition tree automata, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.64-73, 2004.
DOI : 10.1109/LICS.2004.1319601

D. H. De-jongh and R. Parikh, Well-partial orderings and hierarchies, Indagationes Mathematicae (Proceedings), vol.80, issue.3, pp.195-207, 1977.
DOI : 10.1016/1385-7258(77)90067-1

G. Delzanno, J. F. Raskin, and L. Van-begin, Attacking Symbolic State Explosion, Proceedings of CAV 2011, pp.298-31010, 2001.
DOI : 10.1007/3-540-44585-4_28

URL : http://www.ulb.ac.be/di/ssd/jfr/ASEPV01.ps

G. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Ad Hoc Networks, Proceedings of Concur 2010, pp.313-32710, 2010.
DOI : 10.1007/978-3-642-15375-4_22

S. Demri, On selective unboundedness of VASS, Journal of Computer and System Sciences, vol.79, issue.5, pp.689-713, 2013.
DOI : 10.1016/j.jcss.2013.01.014

S. Demri, D. Figueira, and M. Praveen, Reasoning about data repetitions with counter systems, Logical Methods in Computer Science, vol.123, issue.31, pp.1-54, 2016.
DOI : 10.1109/lics.2013.8

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

S. Demri, M. Jurdzi?ski, O. Lachish, and R. Lazi?, 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

N. Dershowitz and Z. Manna, Proving termination with multiset orderings, Communications of the ACM, vol.22, issue.8, pp.465-476, 1979.
DOI : 10.1145/359138.359142

URL : http://www.dtic.mil/get-tr-doc/pdf?AD%3DADA058601%26Location%3DU2%26doc%3DGetTRDoc.pdf

L. E. Dickson, Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors, American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913.
DOI : 10.2307/2370405

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

D. Osualdo, E. Ong, L. Tiu, and A. , Deciding secrecy of security protocols for an unbounded number of sessions: The case of depth-bounded processes, Proceedings of CSF 2017. IEEE, 2017.

M. Englert, R. Lazi?, and P. Totzke, Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.477-484, 2016.
DOI : 10.1016/S0022-0000(75)80005-5

J. Esparza and M. Nielsen, Decidability issues for Petri nets ? a survey, Bulletin of the EATCS, vol.52, pp.244-262, 1994.

J. Esparza, Decidability and complexity of Petri net problems ??? An introduction, Lecture Notes in Computer Science, vol.1491, pp.374-428, 1998.
DOI : 10.1007/3-540-65306-6_20

J. Esparza, R. Ledesma-garza, R. Majumdar, P. Meyer, and F. Niksic, An SMT-Based Approach to Coverability Analysis, Proceedings of CAV 2014, pp.603-619, 2014.
DOI : 10.1007/978-3-319-08867-9_40

J. Esparza, P. Ganty, J. Leroux, and R. Majumdar, Verification of population protocols, Acta Informatica, vol.58, issue.1, pp.191-215, 2017.
DOI : 10.1007/978-3-642-02658-4_59

M. V. Fairtlough and S. S. Wainer, Ordinal complexity of recursive definitions, Information and Computation, vol.99, issue.2, pp.123-153, 1992.
DOI : 10.1016/0890-5401(92)90027-D

M. V. Fairtlough and S. S. Wainer, Hierarchies of Provably Recursive Functions, Handbook of Proof Theory, pp.149-207, 1998.
DOI : 10.1016/S0049-237X(98)80018-9

J. Fearnley and M. Jurdzi?ski, Reachability in two-clock timed automata is PSPACE-complete, Information and Computation, vol.243, pp.26-36, 2015.
DOI : 10.1016/j.ic.2014.12.004

D. Figueira, Alternating register automata on finite words and trees:22). doi:10.2168, Logical Methods in Computer ScienceLMCS, vol.88, issue.11, pp.22-2012, 2012.
DOI : 10.2168/lmcs-8(1:22)2012

URL : https://lmcs.episciences.org/907/pdf

D. Figueira, R. Lazic, J. Leroux, F. Mazowiecki, and G. Sutre, Polynomialspace completeness of reachability for succinct branching VASS in dimension one, Proceedings of ICALP 2017 of Leibniz International Proceedings in Informatics, article 119, 2017.

A. Finkel, A generalization of the procedure of karp and miller to well structured transition systems, Proceedings of ICALP 1987, pp.499-508, 1987.
DOI : 10.1007/3-540-18088-5_43

A. Finkel, Decidability of the termination problem for completely specified protocols, Distributed Computing, vol.28, issue.4, pp.129-135, 1994.
DOI : 10.1007/BF02277857

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere! Theoretical Computer Science, )00102-X. Cited on pages 1, pp.63-92, 2001.
DOI : 10.1016/s0304-3975(00)00102-x

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

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

A. Finkel and J. Goubault-larrecq, Forward analysis for WSTS, part II: Complete WSTS:28). doi:10, Logical Methods in Computer Science, vol.83, issue.3, pp.2168-828, 2012.

A. Finkel and J. Goubault-larrecq, The Theory of WSTS: The Case of Complete WSTS, Proceedings of Petri Nets 2012, pp.3-3110, 2012.
DOI : 10.1007/978-3-642-31131-4_2

P. C. Fischer, A. R. Meyer, and A. L. Rosenberg, Counter machines and counter languages, Mathematical Systems Theory, pp.265-283, 1968.
DOI : 10.1145/321420.321423

R. W. Floyd, Assigning meanings to programs, of Proceedings of Symposia in Applied Mathematics, pp.19-32, 1967.
DOI : 10.1090/psapm/019/0235771

P. Fraigniaud, S. Rajsbaum, T. , and C. , Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings, Proceedings of LATIN 2016, pp.497-50810, 2016.
DOI : 10.1007/978-3-662-49529-2_37

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

H. M. Friedman, Long Finite Sequences, Journal of Combinatorial Theory, Series A, vol.95, issue.1, pp.102-144, 2001.
DOI : 10.1006/jcta.2000.3154

URL : https://doi.org/10.1006/jcta.2000.3154

R. Ganian, P. Hlin?ný, J. Ne?et?il, J. Obdr?álek, P. Ossona-de-mendez et al., When Trees Grow Low: Shrubs and Fast MSO1, Proceedings of MFCS 2012, pp.419-430, 2012.
DOI : 10.1007/978-3-642-32589-2_38

P. Ganty and R. Majumdar, Algorithmic verification of asynchronous programs, ACM Transactions on Programming Languages and Systems, vol.34, issue.1, pp.1-48, 2012.
DOI : 10.1145/2160910.2160915

T. Geffroy, J. Leroux, and G. Sutre, Occam???s Razor Applied to the Petri Net Coverability Problem, Proceedings of RP 2016, pp.77-8910, 2016.
DOI : 10.1007/3-540-48745-X_8

T. Geffroy, J. Leroux, and G. Sutre, Backward coverability with pruning for lossy channel systems, Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software , SPIN 2017, pp.132-141, 2017.
DOI : 10.1007/978-3-642-28756-5_34

B. Genest, A. Muscholl, O. Serre, and M. Zeitoun, Tree Pattern Rewriting Systems, Proceedings of ATVA 2008, pp.332-346, 2008.
DOI : 10.1016/S0020-0190(01)00337-4

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

G. Geeraerts, J. F. Raskin, and L. Van-begin, Expand, Enlarge and Check... Made Efficient, Proceedings of CAV 2005, pp.394-407, 2005.
DOI : 10.1007/11513988_38

URL : http://www.ulb.ac.be/di/ssd/ggeeraer/papers/eec-cav05.pdf

S. M. German and A. P. Sistla, Reasoning about systems with many processes, Journal of the ACM, vol.39, issue.3, pp.675-735, 1992.
DOI : 10.1145/146637.146681

URL : http://www.neng.usu.edu/ece/faculty/bunker/rlist/p675-german.pdf

A. Geser, Relative Termination, 1990.

J. Gischer, Shuffle languages, Petri nets, and context-sensitive grammars, Communications of the ACM, vol.24, issue.9, pp.597-605, 1981.
DOI : 10.1145/358746.358767

S. Göller, C. Haase, R. Lazic, and P. Totzke, A polynomial-time algorithm for reachability in branching VASS in dimension one, Proceedings of ICALP 2016 of Leibniz International Proceedings in Informatics, article 105, 13 pages. LZI. doi:10.4230/LIPIcs.ICALP.2016.105. Cited on, p.73, 2016.

J. Goubault-larrecq, On Noetherian Spaces, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.453-462, 2007.
DOI : 10.1109/LICS.2007.34

J. Goubault-larrecq, Noetherian Spaces in Verification, Proceedings of ICALP 2010, pp.2-21, 2010.
DOI : 10.1007/978-3-642-14162-1_2

. Springer, doi:10.1007/978-3-642-14162-1_2

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

S. A. Greibach, Remarks on blind and partially blind one-way multicounter machines, Theoretical Computer Science, vol.7, issue.3, pp.311-324, 1978.
DOI : 10.1016/0304-3975(78)90020-8

URL : https://doi.org/10.1016/0304-3975(78)90020-8

A. Grzegorczyk, Some classes of recursive functions, Rozprawy Matematyczne, 1953.

S. Gulwani, SPEED: Symbolic Complexity Bound Analysis, Proceedings of CAV 2009, pp.51-62, 2009.
DOI : 10.1007/978-3-540-70545-1_6

. Springer, doi:10.1007/978-3-642-02658-4_7

C. Haase, S. Kreutzer, J. Ouaknine, and J. Worrell, Reachability in Succinct and Parametric One-Counter Automata, Proceedings of Concur 2009, pp.369-383, 2009.
DOI : 10.1007/3-540-45061-0_53

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

M. H. Hack, Decidability questions for Petri nets, pp.64-65, 1975.

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

N. Hirokawa and G. Moser, Automated Complexity Analysis Based on the Dependency Pair Method, Proceedings of IJCAR 2008, pp.364-379, 2008.
DOI : 10.1007/978-3-540-71070-7_32

D. Hofbauer, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Theoretical Computer Science, vol.105, issue.1, pp.129-140, 1992.
DOI : 10.1016/0304-3975(92)90289-R

URL : https://doi.org/10.1016/0304-3975(92)90289-r

J. E. Hopcroft and J. J. Pansiot, On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, vol.8, issue.2, pp.135-159, 1979.
DOI : 10.1016/0304-3975(79)90041-0

R. R. Howell, L. E. Rosier, D. T. Huynh, Y. , and H. C. , Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, Theoretical Computer Science, vol.46, issue.86, pp.107-140, 1986.
DOI : 10.1016/0304-3975(86)90026-5

F. Jacquemard, L. Segoufin, and J. Dimino, FO 2 (<, +1, ?) on data trees, data tree automata and branching vector addition systems, Logical Methods in Computer Science, vol.12, issue.232, pp.10-2168, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00769249

P. Jan?ar, Decidability of a temporal logic problem for Petri nets, Theoretical Computer Science, vol.74, issue.1, pp.71-93, 1990.
DOI : 10.1016/0304-3975(90)90006-4

P. Jan?ar, Nonprimitive recursive complexity and undecidability for Petri net equivalences, Theoretical Computer Science, vol.256, issue.1-2, pp.23-30, 2001.
DOI : 10.1016/S0304-3975(00)00100-6

P. Jan?ar, Bouziane???s transformation of the Petri net reachability problem and incorrectness of the related algorithm, Information and Computation, vol.206, issue.11, pp.1259-1263, 2008.
DOI : 10.1016/j.ic.2008.06.003

J. P. Jouannaud and P. Lescanne, On multiset orderings, Information Processing Letters, vol.15, issue.2, pp.57-6390107, 1982.
DOI : 10.1016/0020-0190(82)90107-7

A. Kaiser, D. Kroening, and T. Wahl, A Widening Approach to Multithreaded Program Verification, ACM Transactions on Programming Languages and Systems, vol.36, issue.4, pp.1-29, 2014.
DOI : 10.1007/978-3-642-31131-4_12

A. Kaiser, D. Kroening, and T. Wahl, Lost in abstraction: Monotonicity in multi-threaded programs. Information and Computation, pp.30-47, 2017.

M. I. Kanovich, Petri nets, Horn programs, linear logic and vector games, Annals of Pure and Applied Logic, vol.7594, issue.12, pp.107-135, 1995.
DOI : 10.1016/0168-0072(94)00060-g

URL : https://doi.org/10.1016/0168-0072(94)00060-g

R. M. Karp and R. E. Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.
DOI : 10.1016/S0022-0000(69)80011-5

URL : https://doi.org/10.1016/s0022-0000(69)80011-5

J. Ketonen and R. Solovay, Rapidly Growing Ramsey Functions, The Annals of Mathematics, vol.113, issue.2, pp.27-314, 1981.
DOI : 10.2307/2006985

B. König and J. Stückrath, Well-structured graph transformation systems, Information and Computation, vol.252, pp.71-94, 2017.
DOI : 10.1016/j.ic.2016.03.005

A. P. Kopylov, Decidability of linear affine logic, Proceedings of LICS 1995, pp.496-504, 1995.

S. R. Kosaraju, Decidability of reachability in vector addition systems, Proceedings of STOC 1982, pp.267-281, 1982.

G. Kreisel, On the interpretation of non-finitist proofs???Part II, The Journal of Symbolic Logic, vol.17, issue.01, pp.43-58, 1952.
DOI : 10.2307/2267457

S. A. Kripke, The problem of entailment, Proceedings of ASL 1959, p.324, 1959.

L. Kristiansen and H. Niggl, On the computational complexity of imperative programming languages, Theoretical Computer Science, vol.318, issue.1-2, pp.139-161, 2004.
DOI : 10.1016/j.tcs.2003.10.016

D. Kroening, N. Sharygina, A. Tsitovich, and C. M. Wintersteiger, Termination Analysis with Compositional Transition Invariants, Proceedings of CAV 2010, pp.89-103, 2010.
DOI : 10.1007/978-3-642-14295-6_9

URL : http://www.kroening.com/papers/cav2010-2.pdf

J. B. Kruskal, Well-quasi-ordering, the Tree Theorem, and Vazsonyi's Conjecture . Transactions of the, pp.210-225, 1960.

J. B. Kruskal, The theory of well-quasi-ordering: A frequently discovered concept, Journal of Combinatorial Theory, Series A, vol.13, issue.3, pp.297-305, 1972.
DOI : 10.1016/0097-3165(72)90063-5

J. L. Lambert, A structure to decide reachability in Petri nets, Theoretical Computer Science, vol.99, issue.1, pp.79-104, 1992.
DOI : 10.1016/0304-3975(92)90173-D

S. Lasota, EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters, vol.109, issue.15, pp.850-855, 2009.
DOI : 10.1016/j.ipl.2009.04.003

R. Lazi?, T. Newcomb, J. O. Ouaknine, A. W. Roscoe, and J. B. Worrell, Nets with Tokens Which Carry Data, Fundamenta Informaticae, vol.88, issue.3, pp.251-274, 2008.
DOI : 10.1007/978-3-540-73094-1_19

R. Lazi?, J. O. Ouaknine, and J. B. Worrell, Zeno, Hercules, and the Hydra, ACM Transactions on Computational Logic, vol.17, issue.3, pp.16-26, 2016.
DOI : 10.1007/978-3-642-15155-2_54

R. Lazi? and P. Totzke, What Makes Petri Nets Harder to Verify: Stack or Data?, Lecture Notes in Computer Science, vol.8, issue.1, pp.144-161, 2017.
DOI : 10.1007/978-3-642-15155-2_54

C. S. Lee, N. D. Jones, and A. M. Ben-amram, The size-change principle for program termination, Proceedings of POPL 2001, pp.81-92, 2001.

L. Sánchez, O. Ovchinnikov, and A. , On bounds for the effective differential Nullstellensatz, Journal of Algebra, vol.449, pp.1-21, 2016.
DOI : 10.1016/j.jalgebra.2015.10.009

I. Lepper, Derivation lengths and order types of Knuth???Bendix orders, Theoretical Computer Science, vol.269, issue.1-2, pp.433-450, 2001.
DOI : 10.1016/S0304-3975(01)00015-9

J. Leroux and G. Sutre, On Flatness for 2-Dimensional Vector Addition Systems with States, Proceedings of Concur, pp.402-416, 2004.
DOI : 10.1137/0213029

J. Leroux, The general vector addition system reachability problem by Presburger inductive invariants, Logical Methods in Computer Science, vol.6, issue.59, pp.1-25, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00272667

J. Leroux, Vector addition system reachability problem: a short selfcontained proof, Proceedings of POPL 2011, pp.307-316, 2011.
DOI : 10.1007/978-3-642-21254-3_3

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

J. Leroux, Vector addition system reversible reachability problem, Logical Methods in Computer Science, vol.9, issue.15, pp.65-66, 2013.
DOI : 10.1007/978-3-642-23217-6_22

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

J. Leroux, M. Praveen, and G. Sutre, A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness, Proceedings of Concur 2013, pp.137-151, 2013.
DOI : 10.1007/978-3-642-40184-8_11

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

. Springer, doi:10.1007/978-3-642-40184-8_11

J. Leroux and P. Schnoebelen, On Functions Weakly Computable by Petri Nets and Vector Addition Systems, Proceedings of RP 2014, 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, Annals of Pure and Applied Logic, vol.56, issue.92, pp.1-3239, 1992.
DOI : 10.1109/fscs.1990.89588

R. J. Lipton, The reachability problem requires exponential space, pp.65-66, 1976.

M. H. Löb and S. S. Wainer, Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung, pp.39-51, 1970.

I. A. Lomazova and P. Schnoebelen, Some Decidability Results for Nested Petri Nets, Proceedings of PSI 1999, pp.208-22010, 2000.
DOI : 10.1007/3-540-46562-6_18

E. W. Mayr, An algorithm for the general Petri net reachability problem, Proceedings of STOC 1981, pp.238-246, 1981.

E. W. Mayr and A. R. Meyer, The Complexity of the Finite Containment Problem for Petri Nets, Journal of the ACM, vol.28, issue.3, pp.561-576, 1981.
DOI : 10.1145/322261.322271

R. Mayr, Process rewrite systems Information and Computation, pp.264-286, 2000.

R. Mayr, Undecidable problems in unreliable computations, Theoretical Computer Science, vol.297, issue.1-3, pp.337-35400646, 2003.
DOI : 10.1016/S0304-3975(02)00646-1

K. Mcaloon, Petri nets and large finite sets, Theoretical Computer Science, vol.32, issue.1-2, pp.173-18390029, 1984.
DOI : 10.1016/0304-3975(84)90029-X

A. R. Meyer and D. M. Ritchie, The complexity of loop programs, Proceedings of the 1967 22nd national conference on -, pp.465-469, 1967.
DOI : 10.1145/800196.806014

A. R. Meyer, Weak monadic second order theory of succesor is not elementary-recursive, Proceedings of Logic Colloquium 1972?73, pp.132-154, 1975.
DOI : 10.1007/BFb0064872

R. Meyer, On Boundedness in Depth in the ??-Calculus, Proceedings of IFIP TCS, pp.477-489, 2008.
DOI : 10.1007/978-0-387-09680-3_32

R. Milner, Operational and Algebraic Semantics of Concurrent Processes, Handbook of Theoretical Computer Science, pp.1201-1242, 1990.
DOI : 10.1016/B978-0-444-88074-1.50024-X

M. Socías and G. , Length of Polynomial Ascending Chains and Primitive Recursiveness., MATHEMATICA SCANDINAVICA, vol.71, issue.2, pp.181-205, 1992.
DOI : 10.7146/math.scand.a-12421

H. Müller, The reachability problem for VAS, Lecture Notes in Computer Science, vol.188, issue.57, pp.376-391, 1984.
DOI : 10.1007/3-540-15204-0_21

C. Nash-williams and . J. St, On well-quasi-ordering finite trees, Mathematical Proceedings of the Cambridge Philosophical Society, vol.59, issue.04, pp.833-835, 1963.
DOI : 10.2307/1993287

E. Omri and A. Weiermann, Classifying the phase transition threshold for Ackermannian functions, Annals of Pure and Applied Logic, vol.158, issue.3, pp.156-162, 2009.
DOI : 10.1016/j.apal.2007.02.004

J. O. Ouaknine and J. B. Worrell, On the decidability and complexity of Metric Temporal Logic over finite words:8). doi:10, Logical Methods in Computer ScienceLMCS, vol.33, issue.118, 2007.

C. A. Petri, Kommunikation mit Automaten, 1962.

A. Podelski and A. Rybalchenko, Transition invariants, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.32-41, 2004.
DOI : 10.1109/LICS.2004.1319598

M. Pouzet and M. Sobrani, The order type of the collection of finite series-parallel posets, Discrete Mathematics, vol.265, issue.1-3, pp.189-211, 2003.
DOI : 10.1016/S0012-365X(02)00580-0

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

O. Rambow, Multiset-valued linear index grammars, Proceedings of the 32nd annual meeting on Association for Computational Linguistics -, pp.263-270, 1994.
DOI : 10.3115/981732.981768

URL : http://arxiv.org/pdf/cmp-lg/9406009v1.pdf

M. Rathjen, The art of ordinal analysis, Proceedings of ICM 2006, pp.45-69, 2006.
DOI : 10.4171/022-2/3

K. Reinhardt, Reachability in Petri Nets with Inhibitor Arcs, Proceedings of RP 2008, pp.239-264, 2008.
DOI : 10.1016/j.entcs.2008.12.042

E. Render and M. Kambites, Rational subsets of polycyclic monoids and valence automata, Information and Computation, vol.207, issue.11, pp.1329-1339, 2009.
DOI : 10.1016/j.ic.2009.02.012

C. Reutenauer, The mathematics of Petri nets, 1990.

R. W. Ritchie, Classes of recursive functions based on Ackermann???s function, Pacific Journal of Mathematics, vol.15, issue.3, pp.1027-1044, 1965.
DOI : 10.2140/pjm.1965.15.1027

N. Robertson and P. D. Seymour, Graph minors XXIII. Nash-Williams' immersion conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.2, pp.181-205, 2010.
DOI : 10.1016/j.jctb.2009.07.003

URL : https://doi.org/10.1006/jctb.1996.0059

F. Rosa-velardo, Ordinal recursive complexity of unordered data nets Information and Computation, pp.41-58, 2017.

L. E. Rosier and H. C. Yen, A multiparameter analysis of the boundedness problem for vector addition systems, Journal of Computer and System Sciences, vol.32, issue.1, pp.105-13590006, 1986.
DOI : 10.1016/0022-0000(86)90006-1

G. S. Sacerdote and R. L. Tenney, The decidability of the reachability problem for vector addition systems, Proceedings of STOC 1977, pp.61-76, 1977.

D. Schmidt, Well-partial orderings and their maximal order types. Habilitationsschrift , Heidelberg, pp.33-76, 1979.

P. Schnoebelen, Verifying lossy channel systems has nonprimitive recursive complexity, Information Processing Letters, vol.83, issue.5, pp.251-261, 2002.
DOI : 10.1016/S0020-0190(01)00337-4

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-IPL2002.pdf

P. Schnoebelen, Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets, Proceedings of MFCS 2010, pp.616-628, 2010.
DOI : 10.1007/978-3-642-15155-2_54

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf

P. Schnoebelen, Lossy Counter Machines Decidability Cheat Sheet, Proceedings of RP 2010, pp.51-75, 2010.
DOI : 10.1007/978-3-642-15349-5_4

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-rp10.pdf

H. Schwichtenberg and S. S. Wainer, Proofs and Computation. Perspectives in Logic, pp.23-76, 2012.

S. G. Simpson, Ordinal numbers and the Hilbert basis theorem, The Journal of Symbolic Logic, vol.65, issue.03, pp.961-974, 1988.
DOI : 10.1016/0168-0072(86)90074-6

S. Steila, Terminating via Ramsey's Theorem, pp.31-32, 2016.

A. M. Turing, Checking a large routine, Proceedings of EDSAC 1949, pp.67-69, 1949.

A. Urquhart, The Complexity of Decision Procedures in Relevance Logic, Truth or Consequences: Essays in honour of Nuel Belnap, pp.61-76, 1990.
DOI : 10.1007/978-94-009-0681-5_5

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

J. Van-der-meeren, Connecting the Two Worlds: Well-partial-orders and Ordinal Notation Systems, pp.33-76, 2015.

M. Y. Vardi, From Philosophical to Industrial Logics, Proceedings of ICLA 2009, pp.89-115, 2009.
DOI : 10.1016/0020-0190(85)90069-9

URL : http://www.cs.rice.edu/~vardi/papers/icla09.pdf

Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich et al., The complexity of multi-mean-payoff and multi-energy games. Information and Computation, pp.177-196, 2015.

K. N. Verma and J. Goubault-larrecq, Karp-Miller trees for a branching extension of VASS, Discrete Mathematics and Theoretical Computer Science, vol.7, issue.1, pp.217-230, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00959038

S. S. Wainer, A classification of the ordinal recursive functions Archiv für Mathematische Logik und Grundlagenforschung, pp.136-153, 1970.

S. S. Wainer, Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy, The Journal of Symbolic Logic, vol.35, issue.02, pp.281-292, 1972.
DOI : 10.1007/BF01967649

A. Weiermann, Complexity Bounds for Some Finite Forms of Kruskal's Theorem, Journal of Symbolic Computation, vol.18, issue.5, pp.463-488, 1994.
DOI : 10.1006/jsco.1994.1059

A. Weiermann, Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths, Theoretical Computer Science, vol.139, issue.1-2, pp.355-362, 1995.
DOI : 10.1016/0304-3975(94)00135-6

T. Wies, D. Zufferey, and T. A. Henzinger, Forward Analysis of Depth-Bounded Processes, Proceedings of FoSSaCS 2010, pp.94-10810, 2010.
DOI : 10.1007/978-3-642-12032-9_8

G. Zetzsche, The complexity of downward closure comparisons, Proceedings of ICALP 2016, pp.64-65, 2016.

F. Zuleger, J. Leroux, and S. Schmitz, Ranking functions for vector addition systems. arXiv:1710.10292 [cs.LO]. Cited on page 70 List of Publications Invited Papers Ideal decompositions for vector addition systems, Proceedings of STACS 2016 of Leibniz International Proceedings in Informatics, article 1, 13 pages, 2016.

S. Schmitz, Automata column: The complexity of reachability in vector addition systems, ACM SIGLOG News, vol.3, issue.54, pp.3-21, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01275972

S. Schmitz, Complexity Bounds for Ordinal-Based Termination, Proceedings of RP 2014, pp.1-19, 2014.
DOI : 10.1007/978-3-319-11439-2_1

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

S. Schmitz and P. Schnoebelen, The Power of Well-Structured Systems, Proceedings of Concur 2013, pp.5-24641, 2013.
DOI : 10.1007/978-3-642-40184-8_2

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

P. Chambart, A. Finkel, and S. Schmitz, Forward analysis and model checking for trace bounded WSTS, Theoretical Computer Science, vol.637, pp.1-29, 2016.
DOI : 10.1016/j.tcs.2016.04.020

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

S. Schmitz, Complexity Hierarchies beyond Elementary, ACM Transactions on Computation Theory, vol.8, issue.1, pp.1-36, 2016.
DOI : 10.1006/jsco.1994.1059

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

R. Lazi? and S. Schmitz, Non-elementary complexities for branching VASS, MELL, and extensions, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-30, 2015.
DOI : 10.1145/2603088.2603129

C. Haase, S. Schmitz, and P. Schnoebelen, The power of priority channel systems, Logical Methods in Computer Science, vol.10, issue.32, pp.1-39, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00793809

P. C. Héam, C. Nicaud, and S. Schmitz, Parametric random generation of deterministic tree automata, Theoretical Computer Science, vol.411, issue.38-39, pp.38-393469, 2010.
DOI : 10.1016/j.tcs.2010.05.036

S. Schmitz, . Th, M. Jurdzi?ski, R. Lazi?, and S. Schmitz, An experimental ambiguity detection tool, Proceedings of LICS 2017. IEEE. doi:10.1109/ LICS.2017.8005105, pp.71-84, 2010.
DOI : 10.1016/j.scico.2009.07.002

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

B. Bérard, S. Haar, S. Schmitz, and S. Schwoon, The Complexity of Diagnosability and Opacity Verification for Petri Nets, Proceedings of Petri Nets 2017, pp.200-22010, 2017.
DOI : 10.1109/TAC.2002.802763

D. Baelde, S. Lunel, and S. Schmitz, A sequent calculus for a modal logic on finite data trees, Proceedings of CSL 2016 of Leibniz International Proceedings in Informatics, article 32, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01191172

J. Goubault-larrecq and S. Schmitz, Deciding piecewise testable separability for regular tree languages, Proceedings of ICALP 2016 of Leibniz International Proceedings in Informatics, article 97, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01276119

R. Lazi? and S. Schmitz, The Complexity of Coverability in ??-Petri Nets, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.467-476, 2016.
DOI : 10.1007/BF01973619

P. Hofman, S. Lasota, R. Lazi?, J. Leroux, S. Schmitz et al., Coverability Trees for Petri Nets with Unordered Data, Proceedings of FoS- SaCS 2016, pp.445-461, 2016.
DOI : 10.1007/978-3-642-15155-2_54

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

M. Jurdzi?ski, R. Lazi?, and S. Schmitz, Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time, Proceedings of ICALP 2015, pp.260-27210, 2015.
DOI : 10.1007/978-3-662-47666-6_21

J. Leroux and S. 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. B. Courtois and S. Schmitz, Alternating Vector Addition Systems with States, Proceedings of MFCS 2014, pp.220-231, 2014.
DOI : 10.1007/978-3-662-44522-8_19

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

S. Schmitz, Implicational Relevance Logic is 2-ExpTime-Complete, Proceedings of RTA-TLCA 2014, pp.395-409, 2014.
DOI : 10.1007/978-3-319-08918-8_27

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

R. Lazi? and S. Schmitz, Non-elementary complexities for branching VASS, MELL, and extensions, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603129

C. Haase, S. Schmitz, and P. Schnoebelen, The Power of Priority Channel Systems, Proceedings of Concur 2013, pp.319-33310, 2013.
DOI : 10.1007/978-3-642-40184-8_23

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

A. Boral and S. Schmitz, Model-Checking Parse Trees, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.153-162, 2013.
DOI : 10.1109/LICS.2013.21

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

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

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

E. Bertsch, M. J. Nederhof, and S. Schmitz, On LR Parsing with Selective Delays, Proceedings of CC 2013, pp.244-263978, 2013.
DOI : 10.1007/978-3-642-37051-9_13

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

S. Haddad, S. Schmitz, and P. 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

M. Blockelet and S. Schmitz, Model Checking Coverability Graphs of Vector Addition Systems, Proceedings of MFCS 2011, pp.108-119, 2011.
DOI : 10.1007/978-3-642-22993-0_13

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

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

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SS-arxiv11.pdf

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, 2011.
DOI : 10.1109/LICS.2011.39

P. Chambart, A. Finkel, and S. Schmitz, Forward Analysis and Model Checking for Trace Bounded WSTS, Proceedings of Petri Nets 2011, pp.49-6810, 2011.
DOI : 10.1016/0022-0000(81)90067-2

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

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

P. C. Héam, C. Nicaud, and S. Schmitz, Random Generation of Deterministic Tree (Walking) Automata, Proceedings of CIAA 2009, pp.115-124, 2009.
DOI : 10.1007/11591191_28

S. Schmitz, Conservative Ambiguity Detection in Context-Free Grammars, Proceedings of ICALP 2007, pp.692-703, 2007.
DOI : 10.1007/978-3-540-73420-8_60

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

S. Schmitz, Noncanonical LALR(1) Parsing, Proceedings of DLT 2006, pp.95-10710, 2006.
DOI : 10.1007/11779148_10

[. Gálvez, J. Schmitz, S. Farré, J. R. Schmitz, and S. , Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time, Proceedings of CIAA 2006 Proceedings of RP 2015, pp.253-264, 2006.
DOI : 10.1007/11812128_24

C. Gardent, Y. Parmentier, G. Perrier, and S. Schmitz, Lexical Disambiguation in LTAG Using Left Context, Proceedings of LTC 2011, pp.67-79, 2014.
DOI : 10.1007/978-3-319-14120-6_6

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

S. Schmitz, A note on sequential rule-based POS tagging, Proceedings of FSMNLP 2011, pp.83-87, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00600260

S. Schmitz, L. Roux, and J. , Feature unification in TAG derivation trees, Proceedings of TAG+9, pp.141-148, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00276326

S. Schmitz, An Experimental Ambiguity Detection Tool, Proceedings of LDTA 2007, pp.69-84, 2008.
DOI : 10.1016/j.entcs.2008.03.045

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

F. Schmitz, S. , L. Roux, and J. , Calculs d'unification sur les arbres de dérivation TAG, Proceedings of TALN 2008, pp.320-329, 2008.

S. Schmitz, Approximating Context-Free Grammars for Parsing and Verification Modular syntax demands verification, Research Reports, 2006.