L. B. Borosh and . Treybig, Bounds on positive integral solutions of linear Diophantine equations, Proceedings of the American Mathematical Society, vol.55, issue.2, pp.299-304, 1976.
DOI : 10.1090/S0002-9939-1976-0396605-3

N. Cohen and . Megiddo, Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs, Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC '89, pp.523-534, 1989.
DOI : 10.1145/73007.73057

J. Esparza, Decidability and complexity of Petri net problems ? an introduction In Advances in Petri Nets '98, LNCS, vol.1491, pp.374-428, 1998.

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

D. Figueira, S. Figueira, S. Schmitz, and P. Schnoebelen, Ackermannian and primitive-recursive bounds with dickson's lemma URL: https, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, pp.269-278, 2011.
DOI : 10.1109/lics.2011.39
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FFSS-arxiv10.pdf

E. John, J. Hopcroft, and . Pansiot, On the reachability problem for 5- dimensional vector addition systems, Theor. Comput. Sci, vol.8, issue.79, pp.135-159, 1979.

H. R. Rao-kosaraju, B. B. Lewis, W. A. Simons, L. H. Burkhard, and . Landweber, 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

R. Kosaraju and G. F. Sullivan, Detecting cycles in dynamic graphs in polynomial time (preliminary version), Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.398-406, 1988.

J. Lambert, A structure to decide reachability in petri nets URL: https://doi, Theor. Comput. Sci, vol.9992, issue.1, pp.79-1040304, 1992.

J. Leroux and S. Schmitz, Demystifying reachability in vector addition systems URL: https, 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, pp.56-67, 2015.
DOI : 10.1109/lics.2015.16
URL : http://arxiv.org/pdf/1503.00745

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

E. W. Mayr, An algorithm for the general petri net reachability problem, Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp.238-246, 1981.

E. W. Mayr, An Algorithm for the General Petri Net Reachability Problem, SIAM Journal on Computing, vol.13, issue.3, pp.441-460, 1984.
DOI : 10.1137/0213029

W. Ernst, A. R. Mayr, and . Meyer, The complexity of the finite containment problem for petri nets, J. ACM, vol.28, issue.3, pp.561-576, 1981.

L. Pottier, Minimal solutions of linear diophantine systems : bounds and algorithms, Proceedings of the 4th International Conference on Rewriting Techniques and Applications, RTA '91, pp.162-173, 1991.
DOI : 10.1007/3-540-53904-2_94

K. Praveen and . Lodaya, Analyzing Reachability for Some Petri Nets With Fast Growing Markings, Electronic Notes in Theoretical Computer Science, vol.223, pp.215-237, 2008.
DOI : 10.1016/j.entcs.2008.12.041