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

A. Arnold and M. Latteux, Récursivit et cônes rationnels fermés par intersection, pp.381-394, 1978.
DOI : 10.1007/bf02576519

T. Ball, S. Chaki, and S. K. Rajamani, Parameterized Verification of Multithreaded Software Libraries, TACAS (Lect. Notes Comp. Sci.), vol.2031, pp.158-173, 2001.
DOI : 10.1007/3-540-45319-9_12
URL : http://www.cs.cmu.edu/~chaki/academics/../publications/TACAS-2001.ps.gz

L. Berman, The Complexitiy of Logical Theories, Theor. Comput. Sci, vol.1180, pp.71-770304, 1980.

E. Best and J. Esparza, Existence of home states in Petri nets is decidable, Information Processing Letters, vol.116, issue.6, pp.423-427, 2016.
DOI : 10.1016/j.ipl.2016.01.011

M. Blondin, A. Finkel, C. Haase, and S. Haddad, Approaching the Coverability Problem Continuously, TACAS (Lect. Notes Comp. Sci.), vol.9636, pp.480-496978, 2016.
DOI : 10.1007/978-3-662-49674-9_28
URL : https://hal.archives-ouvertes.fr/hal-01408044

I. Borosh and L. B. Treybing, Bounds on Positive Integral Solutions of Linear Diophantine Equations. P. Am, Math. Soc, vol.55, issue.2, pp.299-304, 1976.

L. Bozzelli and P. Ganty, Complexity Analysis of the Backward Coverability Algorithm for VASS, Reachability Problems, RP (Lect. Notes Comp. Sci.), pp.96-109, 2011.
DOI : 10.1016/j.tcs.2009.02.036

E. Cardoza, R. J. Lipton, and A. R. Meyer, Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report), Proceedings of the eighth annual ACM symposium on Theory of computing , STOC '76, 1976.
DOI : 10.1145/800113.803630

D. Chistikov, C. Haase, S. Halfon, and ?. Doi, Context-free commutative grammars with integer counters and resets, Theoretical Computer Science, 2017.
DOI : 10.1016/j.tcs.2016.06.017
URL : http://arxiv.org/abs/1511.04893

R. David and H. Alla, Continuous Petri nets, Proc. 8th European Workshop on Application and Theory of Petri nets, pp.275-294, 1987.
URL : https://hal.archives-ouvertes.fr/hal-00495611

R. David and H. Alla, Discrete, Continuous, and Hybrid Petri nets, pp.978-981, 2010.
DOI : 10.1007/978-3-642-10669-9
URL : https://hal.archives-ouvertes.fr/hal-00495611

D. De, F. Escrig, and C. Johnen, Decidability of home space property, 1989.

L. Mendonça-de-moura and N. Bjørner, Z3: An Efficient SMT Solver, TACAS (Lect. Notes Comp. Sci.), vol.4963, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

G. Delzanno, J. Raskin, and L. Van-begin, Attacking Symbolic State Explosion, Computer Aided Verification, pp.298-310, 2001.
DOI : 10.1007/3-540-44585-4_28
URL : http://www.ulb.ac.be/di/ssd/jfr/ASEPV01.ps

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.2-3, 2004.
DOI : 10.1109/DCC.1995.515538

J. Desel and J. Esparza, Free Choice Petri nets. Cambridge Tracts in Theoret, Comp. Sci, vol.40, 1995.
DOI : 10.1017/cbo9780511526558

D. Emanuele, J. Osualdo, C. Kochems, and . Ong, Automatic Verification of Erlang- Style Concurrency, Static Analysis, pp.454-476978, 2013.

D. Emanuele, J. Osualdo, L. Kochems, and . Ong, Soter: an automatic safety verifier for Erlang, Programming based on Actors, Agents, and Decentralized Control, pp.137-140, 2012.

J. Esparza, R. An-ledesma-garza, R. Majumdar, P. Meyer, and F. Nik?i´nik?i´c, An SMT-Based Approach to Coverability Analysis, Computer Aided Verification, pp.603-619978, 2014.
DOI : 10.1007/978-3-319-08867-9_40

J. Esparza and S. Melzer, Verification of Safety Properties Using Integer Programming: Beyond the State Equation, Formal Methods in System Design, vol.16, issue.2, pp.159-189, 2000.
DOI : 10.1023/A:1008743212620

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, J. Raskin, M. Samuelides, and L. Van-begin, Monotonic Extensions of Petri Nets, Electronic Notes in Theoretical Computer Science, vol.68, issue.6, pp.85-106, 2002.
DOI : 10.1016/S1571-0661(04)80535-8
URL : https://hal.archives-ouvertes.fr/hal-00158709

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere! Theor, Comput . Sci, vol.256, issue.00, pp.1-2, 2001.
DOI : 10.1016/s0304-3975(00)00102-x
URL : https://doi.org/10.1016/s0304-3975(00)00102-x

E. Fraca and S. Haddad, Complexity Analysis of Continuous Petri Nets. Fundam, Inform, vol.137, issue.1, pp.1-28, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01241119

P. Ganty, Algorithmes et structures de données efficaces pour la manipulation de contraintes sur les intervalles (in French) Master's thesis, 2002.

P. Ganty, C. Meuter, G. Delzanno, and G. Kalyon, Jean-François Raskin, and Laurent Van Begin Symbolic Data Structure for sets of k-uples, 2007.

G. Geeraerts, J. Raskin, and L. 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

G. Geeraerts, J. Raskin, and L. Van-begin, ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS, International Journal of Foundations of Computer Science, vol.3, issue.02, pp.135-165, 2010.
DOI : 10.1007/s10009-003-0110-0

T. Geffroy, J. Leroux, and G. Sutre, Occam???s Razor Applied to the Petri Net Coverability Problem, In Reachability Problems, RP (Lect. Notes Comp. Sci.), vol.6, issue.2, pp.77-89, 2016.
DOI : 10.1007/3-540-48745-X_8
URL : http://arxiv.org/pdf/1607.05956

M. Steven, A. P. German, and . Sistla, Reasoning about Systems with Many Processes, J. ACM, vol.39, issue.3, pp.675-735, 1992.

M. Henri and T. Hack, The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems, Switching and Automata Theory, SWAT (FOCS). IEEE Computer Society, pp.156-16428, 1974.

M. Henri and T. Hack, Decidability questions for Petri Nets, 1976.

M. Heiner, D. R. Gilbert, and R. Donaldson, Petri Nets for Systems and Synthetic Biology, Formal Methods for Computational Systems Biology, 8th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM (Lect. Notes Comp. Sci.), pp.215-264, 2008.
DOI : 10.1007/978-3-540-68894-5_7
URL : http://www.brc.dcs.gla.ac.uk/~drg/publications/tutorials/bertinoro.pdf

P. Jan?ar, Deciding Structural Liveness of Petri Nets In Current Trends in Theory and Practice of, Computer Science, SOFSEM (Lect. Notes Comp. Sci.), vol.10139, pp.91-102, 2017.

J. Jank, Issue Tracking Systems, 2009.

A. Kaiser, D. Kroening, and T. Wahl, Efficient Coverability Analysis by Proof Minimization, Concurrency Theory, pp.500-515, 2012.
DOI : 10.1007/978-3-642-32940-1_35

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-1429, 2014.
DOI : 10.1007/978-3-642-31131-4_12
URL : http://dl.acm.org/ft_gateway.cfm?id=2629608&type=pdf

M. Richard, R. E. Karp, and . Miller, Parallel Program Schemata: A Mathematical Model for Parallel Computation, Switching and Automata Theory, SWAT (FOCS). IEEE Computer Society, pp.55-6127, 1967.

J. Kloos, R. Majumdar, F. Niksic, and R. Piskac, Incremental, Inductive Coverability, Computer Aided Verification, pp.158-173, 2013.
DOI : 10.1007/978-3-642-39799-8_10
URL : http://www.cs.yale.edu/homes/piskac/publications/KloosETALIIC.pdf

R. Kosaraju, Decidability of reachability in vector addition systems (Preliminary Version), Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.267-281, 1982.
DOI : 10.1145/800070.802201

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

J. Leroux, The General Vector Addition System Reachability Problem by Presburger Inductive Invariants, Logic in Computer Science, LICS. IEEE Computer Society, pp.4-13, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00272667

J. Leroux, Vector Addition System Reachability Problem: A Short Self-contained Proof, Language and Automata Theory and Applications, pp.41-64, 2011.
DOI : 10.1145/322261.322271
URL : https://hal.archives-ouvertes.fr/hal-00599756

J. Leroux, Vector Addition Systems Reachability Problem (A Simpler Solution) In The Alan Turing Centenary Conference, EasyChair, pp.214-228, 2012.

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

R. J. Lipton, The Reachability Problem Requires Exponential Space, 1976.

R. Majumdar, R. Meyer, and Z. Wang, Static Provenance Verification for Message Passing Programs, Static Analysis, pp.366-387978, 2013.
DOI : 10.1007/978-3-642-38856-9_20
URL : http://concurrency.cs.uni-kl.de/documents/Majumdar_Meyer_Wang_SAS_2013.pdf

E. W. Mayr, An Algorithm for the General Petri Net Reachability Problem, In Symposium on Theory of Computing, STOC. ACM, pp.238-246, 1981.
DOI : 10.1145/800076.802477

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

L. Recalde, E. Teruel, and M. S. Sú-arez, Autonomous Continuous P/T Systems, Application and Theory of Petri Nets, ICATPN (Lect. Notes Comp. Sci.), pp.107-126, 1999.
DOI : 10.1007/3-540-48745-X_8

N. Venkatramana, M. N. Reddy, M. L. Liebman, and . Mavrovouniotis, Qualitative analysis of biochemical reaction systems, Comput. Biol. Med, vol.26, issue.1, pp.9-24, 1996.

P. Reynier and F. Servais, Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning, Fundam. Inform, vol.3, issue.2, pp.1-2, 2013.
DOI : 10.1016/S0022-0000(69)80011-5
URL : https://hal.archives-ouvertes.fr/hal-00554919

P. Schnoebelen, Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets, Mathematical Foundations of Computer Science, pp.616-628978, 2010.
DOI : 10.1007/978-3-642-15155-2_54
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/phs-mfcs10.pdf

A. Schrijver, Theory of Linear and Integer Programming, 1998.

E. D. Sontag, Real addition and the polynomial hierarchy, Information Processing Letters, vol.20, issue.3, pp.115-1200020, 1985.
DOI : 10.1016/0020-0190(85)90076-6
URL : http://www.math.rutgers.edu/~sontag/FTP_DIR/ra.pdf

F. Thoen and F. Catthoor, Modeling, verification and exploration of task-level concurrency in real-time embedded systems, 2000.
DOI : 10.1007/978-1-4615-4437-1

A. Valmari and H. Hansen, Old and New Algorithms for Minimal Coverability Sets, Fundam. Inform, vol.131, issue.1, pp.1-25, 2014.
DOI : 10.1007/978-3-642-31131-4_12

M. P. Wil and . Van-der-aalst, The application of Petri nets to workflow management, J. Circuit. Syst. Comp, vol.8, issue.1, pp.21-66, 1998.

. Kumar-neeraj, H. Verma, T. Seidl, and . Schwentick, On the Complexity of Equational Horn Clauses, Automated Deduction -CADE-20 (Lect. Notes Comp. Sci.), pp.337-352, 2005.