P. Abdulla, A. Aziz, B. Bouajjani, and . Jonsson, On-the-fly analysis of systems with unbounded, lossy FIFO channels, Proc. 10 th International Conference on Computer Aided Verification (CAV), pp.305-318, 1998.
DOI : 10.1007/BFb0028754

P. Abdulla, A. Aziz, A. Collomb-annichini, B. Bouajjani, and . 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

. Applegate, W. J. David, S. Cook, . Dash, G. Daniel et al., Exact solutions to linear programming problems, Operations Research Letters, vol.35, issue.6, pp.693-699, 2007.
DOI : 10.1016/j.orl.2006.12.010

P. Abdulla, K. Aziz, B. Cerans, Y. Jonsson, and . Tsay, General decidability theorems for infinite-state systems, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.313-321, 1996.
DOI : 10.1109/LICS.1996.561359

P. Abdulla, K. Aziz, B. Cerans, Y. Jonsson, and . 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

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

V. Antaki, Accessibilité dans les systèmes à compteurs continus: théorique et pratique, 2015.

. Ball, S. Thomas, . Chaki, K. Sriram, and . Rajamani, Parameterized Verification of Multithreaded Software Libraries, Proc. 7 th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.158-173, 2001.
DOI : 10.1007/3-540-45319-9_12

. Blondin, A. Michael, S. Finkel, C. Göller, P. Haase 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
DOI : 10.1109/LICS.2015.14

. Blondin, A. Michael, C. Finkel, S. Haase, and . Haddad, Approaching the Coverability Problem Continuously, Proc. 22 nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.480-496, 2016.
DOI : 10.1007/978-3-662-49674-9_28

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

M. Blondin, A. Finkel, and P. Mckenzie, Handling Infinitely Branching WSTS, Proc. 41 st International Colloquium on Automata, Languages, and Programming (ICALP), pp.13-25
DOI : 10.1007/978-3-662-43951-7_2

. Blondin, A. Michael, P. Finkel, and . Mckenzie, Handling infinitely branching well-structured transition systems, Information and Computation, 2016.

L. Bozzelli and P. Ganty, Complexity Analysis of the Backward Coverability Algorithm for VASS, Proc. 5 th International Workshop on Reachability Problems (RP), pp.96-109, 2011.
DOI : 10.1007/978-3-642-24288-5_10

. Barth, J. C. Adam, A. Mitchell, S. Datta, and . Sundaram, Privacy and Utility in Business Processes, 20th IEEE Computer Security Foundations Symposium (CSF'07), pp.279-294, 2007.
DOI : 10.1109/CSF.2007.26

R. David and . Et-hassane-alla, Continuous petri nets, Proc. 8 th European Workshop on Application and Theory of Petri nets, tome 340, pp.275-294, 1987.
URL : https://hal.archives-ouvertes.fr/hal-00495611

R. David and . Et-hassane-alla, Discrete, Continuous, and Hybrid Petri nets, 2010.
DOI : 10.1007/978-3-642-10669-9

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

C. Dufourd, A. Finkel, and P. Schnoebelen, Reset nets between decidability and undecidability, Proc. 25 th International Colloquium on Automata, Languages and Programming (ICALP), pp.103-115, 1998.
DOI : 10.1007/BFb0055044

L. Dic13-]-dickson and . Eugene, 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

C. Dufourd, P. Jan?ar, and P. Schnoebelen, Boundedness of Reset P/T Nets, Proc. 26 th International Colloquium on Automata, Languages and Programming (ICALP), pp.301-310
DOI : 10.1007/3-540-48523-6_27

[. Osualdo, J. Emanuele, L. Kochems, and . Ong, Soter: an automatic safety verifier for Erlang, Proc. 2 nd International Workshop on Programming based on Actors, Agents, and Decentralized Control (AGERE), pp.137-140, 2012.

D. Osualdo, J. Emanuele, C. Kochems, and . Ong, Automatic verification of Erlang-style concurrency, Proc. 20 th International Symposium on Static Analysis (SAS), pp.454-476

G. Delzanno, J. Raskin, and L. Van-begin, Covering sharing trees: a compact data structure for parameterized verification, International Journal on Software Tools for Technology Transfer, vol.structure, issue.1???2, pp.268-297, 2004.
DOI : 10.1016/S0022-0000(69)80011-5

F. Meyer and . Niksic, An SMT-based approach to coverability analysis, Proc. 26 th International Conference on Computer Aided Verification (CAV), pp.603-619, 2014.

M. Englert, R. Lazi?, and P. Totzke, Reachability in twodimensional unary vector addition systems with states is NL-complete

J. Esparza and S. Melzer, Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, pp.159-189, 2000.

E. Emerson, . Allen, S. Kedar, and . Namjoshi, On model checking for nondeterministic infinite-state systems, Proc. 13 th Annual IEEE Symposium on Logic in Computer Science (LICS), pp.70-80, 1998.

H. B. Enderton, A Mathematical Introduction to Logic, 2001.

. Esp06, . Espinoza, and G. Daniel, On Linear Programming, Integer Programming and Cutting Planes, Thèse de doctorat, Georgia Institute of Technology, 2006.

P. Erd?s, A. Et, and . Tarski, On Families of Mutually Exclusive Sets, The Annals of Mathematics, vol.44, issue.2, pp.315-329, 1943.
DOI : 10.2307/1968767

A. Finkel and J. Goubault-larrecq, Forward analysis for WSTS, part I: completions, Proc. 26 th International Symposium on Theoretical Aspects of Computer Science (STACS), 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, Logical Methods in Computer Science, vol.8, issue.3, p.2012

E. Fraca and S. Haddad, Complexity Analysis of Continuous Petri Nets, Fundamenta Informaticae, vol.137, issue.1, pp.1-28
DOI : 10.1007/978-3-642-38697-8_10

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

A. Finkel, Reduction and covering of infinite reachability trees. Information and Computation, pp.144-179, 1990.

J. Fearnley and M. Jurdzi?ski, Reachability in two-clock timed automata is PSPACE-complete. Information and Computation, pp.26-36, 2015.

A. Finkel and J. Leroux, Recent and simple algorithms for Petri nets, Software and System Modeling, pp.719-725, 2015.
DOI : 10.1007/s10270-014-0426-0

A. Finkel, P. Mckenzie, and C. Picaronny, A well-structured framework for analysing petri net extensions, Information and Computation, vol.195, issue.1-2, pp.1-29, 2004.
DOI : 10.1016/j.ic.2004.01.005

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere! Theoretical Computer Science, pp.63-92, 2001.

J. Ferrante and C. Rackoff, A Decision Procedure for the First Order Theory of Real Addition with Order, SIAM Journal on Computing, vol.4, issue.1, pp.69-76, 1975.
DOI : 10.1137/0204006

R. Fra86-]-fraïssé, Theory of relations, Studies in Logic and the Foundations of Mathematics, pp.1-456, 1986.

. Fra97 and M. Franchella, On the origins of Dénes König's infinity lemma, Archive for History of Exact Sciences, vol.51, issue.1, pp.3-27, 1997.

A. Finkel and G. Sutre, Decidability of Reachability Problems for Classes of Two Counters Automata, Proc. 17 th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.346-357, 2000.
DOI : 10.1007/3-540-46541-3_29

P. Ganty, Algorithmes et structures de données efficaces pour la manipulation de contraintes sur les intervalles, 2002.

. Ganty, G. Pierre, and . Geeraerts, Le probl??me de couverture pour les r??seaux de Petri. R??sultats classiques et d??veloppements r??cents, Techniques et sciences informatiques, vol.28, issue.9, pp.1107-1142, 2009.
DOI : 10.3166/tsi.28.1107-1142

. Geeraerts, A. Gilles, and M. Heußner, Praveen et Jean-François Raskin: ?-Petri nets: Algorithms and complexity, Fundamenta Informaticae, vol.137, issue.1, pp.29-60, 2015.

M. R. Garey, S. Et-david, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

J. Goubault-larrecq, P. Karandikar, K. Narayan, and . Kumar, The ideal approach to computing closed subsets in well-quasi-orderings, 2016.

P. Ganty, C. Meuter, G. Delzanno, and G. Kalyon, Jean François Raskin et Laurent Van Begin: Symbolic data structure for sets of k-uples of integers, 2007.

P. Ganty, Jean-François Raskin et Laurent Van Begin: A complete abstract interpretation framework for coverability properties of WSTS

. Geeraerts, J. Gilles, L. Raskin, and . Van-begin, Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS, Journal of Computer and System Sciences, vol.72, issue.1, pp.180-203, 2006.
DOI : 10.1016/j.jcss.2005.09.001

. Geeraerts, J. Gilles, L. Raskin, and . Van-begin, ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS, International Journal of Foundations of Computer Science, vol.21, issue.02, pp.135-165, 2010.
DOI : 10.1142/S0129054110007180

S. Ginsburg and H. Edwin, Semigroups, Presburger formulas, and languages, Pacific Journal of Mathematics, vol.16, issue.2, pp.285-296, 1966.
DOI : 10.2140/pjm.1966.16.285

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

C. Haase, On the Complexity of Model Checking Counter Automata, Thèse de doctorat, 2012.

M. Heiner, D. R. Gilbert, and R. Donaldson, Petri nets for systems and synthetic biology. Dans Formal Methods for Computational Systems Biology, Proc. 8 th International School on Formal Methods for the Design of Computer, pp.215-264, 2008.

C. Haase and S. Halfon, Integer Vector Addition Systems with States, Proc. 8 th International Workshop on Reachability Problems (RP), tome 8762 de Lecture Notes in Computer Science, pp.112-124, 2014.
DOI : 10.1007/978-3-319-11439-2_9

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

C. Haase, S. Kreutzer, J. Ouaknine, and J. Worrell, Reachability in Succinct and Parametric One-Counter Automata, Proc. 20 th International Conference on Concurrency Theory (CON- CUR), pp.369-383, 2009.
DOI : 10.1007/3-540-45061-0_53

J. E. Hopcroft, R. Motwani, and D. Jeffrey, Ullman: Introduction to automata theory, languages, and computation, 2001.

C. A. Hoare, Communicating Sequential Processes, 1985.

J. E. Hopcroft, J. Et, and . 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, E. Louis, D. T. Rosier, . Huynh, and . Hsu-chun-yen, Some complexity bounds for problems concerning finite and

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

. Lec15 and A. Lechner, Synthesis problems for one-counter automata, Proc. 9 th International Workshop on Reachability Problems (RP), pp.89-100, 2015.

J. Leroux, The General Vector Addition System Reachability Problem by Presburger Inductive Invariants, Proc. 24 th Annual IEEE Symposium on Logic in Computer Science (LICS), pp.4-13, 2009.
DOI : 10.2168/LMCS-6(3:22)2010

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

J. Leroux, Vector addition system reachability problem: a short self-contained proof, Proc. 5 th International Conference on Language and Automata Theory and Applications (LATA), pp.41-64
URL : https://hal.archives-ouvertes.fr/hal-00599756

. Ler12 and . Leroux, Jérôme: Vector addition systems reachability problem (a simpler solution) Dans The Alan Turing Centenary Conference, pp.214-228, 2012.

. Addison-wesley, Extrait disponible à http, 1995.

R. J. Lipton, The reachability problem requires exponential space. Rapport technique 63, 1976.

R. J. Lip09-]-lipton, An EXPSPACE lower bound. https://rjlipton. wordpress.com, 2009.

J. Leroux and G. Sutre, On Flatness for 2-Dimensional Vector Addition Systems with States, Proc. 15 th International Conference on Concurrency Theory (CONCUR), pp.402-416, 2004.
DOI : 10.1137/0213029

J. Leroux, . Et-sylvain, 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. Leroux, G. Sutre, and P. Totzke, On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
DOI : 10.1007/978-3-662-47666-6_26

E. W. Mayr, An algorithm for the general Petri net reachability problem, Proc. 13 th Annual ACM Symposium on Theory of Computing (STOC), pp.238-246, 1981.

L. Mendonça-de-moura and N. Bjørner, Z3: an efficient SMT solver, Proc. 14 th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.337-340, 2008.

R. Majumdar, R. Meyer, and Z. Wang, Static Provenance Verification for Message Passing Programs, Proc. 20 th International Symposium on Static Analysis (SAS), pp.366-387, 2013.
DOI : 10.1007/978-3-642-38856-9_20

J. K. Pachl, Reachability problems for communicating finite state machines. Rapport technique CS-82-12, 1982.

V. N. Reddy, M. N. Liebman, and M. L. , Qualitative analysis of biochemical reaction systems, Computers in Biology and Medicine, vol.26, issue.1, pp.9-24, 1996.
DOI : 10.1016/0010-4825(95)00042-9

. Reynier, F. Pierre-alain, and . Servais, Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning, Fundamenta Informaticae, vol.3, issue.2, pp.1-30, 2013.
DOI : 10.1016/S0022-0000(69)80011-5

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

. Recalde, E. Laura, M. Teruel, and . Silva, Autonomous Continuous P/T Systems, Proc. 20 th International Conference on Application and Theory of Petri Nets 1999 (ICATPN), pp.107-126
DOI : 10.1007/3-540-48745-X_8

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

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

. Sip06 and . Sipser, Michael: Introduction to the theory of computation, Thomson Course Technology, 2 e édition, 2006.

. Son85 and E. D. Sontag, Real addition and the polynomial hierarchy, Information Processing Letters, vol.20, issue.3, pp.115-120, 1985.

S. Schmitz and P. Schnoebelen, Algorithmic Aspects of WQO Theory, 2012.
URL : https://hal.archives-ouvertes.fr/cel-00727025

G. S. Sacerdote, L. Et-richard, and . Tenney, The decidability of the reachability problem for vector addition systems (Preliminary Version), Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77
DOI : 10.1145/800105.803396