T. Araki and T. Kasami, Some decision problems related to the reachability problem for Petri nets, Theoretical Computer Science, vol.3, issue.1, pp.85-104, 1976.
DOI : 10.1016/0304-3975(76)90067-0

T. Araki and T. Kasami, Decidable problems on the strong connectivity of Petri net reachability sets, Theoretical Computer Science, vol.4, issue.1, pp.99-119, 1977.
DOI : 10.1016/0304-3975(77)90059-7

M. F. Atig and P. Habermehl, ON YEN'S PATH LOGIC FOR PETRI NETS, International Journal of Foundations of Computer Science, vol.22, issue.04, pp.783-799, 2011.
DOI : 10.1142/S0129054111008428

H. G. Baker, Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems, 1973. M.I.T

A. Blumensath and E. Grädel, Automatic structures, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.51-62, 2000.
DOI : 10.1109/LICS.2000.855755

B. Boigelot, Symbolic methods for exploring infinite state spaces, 1998.

A. Boudet and H. Comon, Diophantine equations, Presburger arithmetic and finite automata, CAAP, volume 1059 of Lecture Notes in Computer Science, pp.30-43, 1996.
DOI : 10.1007/3-540-61064-2_27

Z. Bouziane and A. Finkel, Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible, INFINITY'97, pp.15-24, 1997.
DOI : 10.1016/S1571-0661(05)80423-2

M. Bozga, R. Iosif, and F. Konecn´ykonecn´y, Fast Acceleration of Ultimately Periodic Relations, CAV'10, pp.227-242, 2010.
DOI : 10.1007/978-3-642-14295-6_23
URL : https://hal.archives-ouvertes.fr/hal-01418908

H. Comon and Y. Jurski, Multiple counters automata, safety analysis and presburger arithmetic, CAV'98, pp.268-279, 1998.
DOI : 10.1007/BFb0028751

J. Esparza, Petri nets, commutative context-free grammars, and basic parallel processes, Fundamenta Informaticae, issue.13, pp.3113-3139, 1997.
DOI : 10.1007/3-540-60249-6_54

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

A. Finkel, J. Leroux, P. Darondeau, S. Demri, R. Meyer et al., How to Compose Presburger-Accelerations: Applications to Broadcast Protocols, FST&TCS'02, pp.145-156, 2002.
DOI : 10.1007/3-540-36206-1_14

D. Gabbay, Expressive functional completeness in tense logic, Aspects of Philosophical Logic, pp.91-117, 1981.

S. Ginsburg and E. Spanier, Bounded ALGOL-like languages. Transactions od the, pp.333-368, 1964.

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

J. Grabowski, The decidability of persistence for vector addition systems, Information Processing Letters, vol.11, issue.1, pp.20-23, 1980.
DOI : 10.1016/0020-0190(80)90026-5

M. Hack, Decidability Questions for Petri nets, 1975.

M. Hack, The equality problem for vector addition systems is undecidable, Theoretical Computer Science, vol.2, issue.1, pp.77-96, 1976.
DOI : 10.1016/0304-3975(76)90008-6

D. Hauschildt, Semilinearity of the reachability set is decidable for Petri nets, 1990.

M. Hennessy and R. Milner, On observing nondeterminism and concurrency, Lecture Notes in Computer Science, vol.80, issue.85, pp.299-309, 1980.
DOI : 10.1007/3-540-10003-2_79

P. W. Hoogers, H. C. Kleijn, and P. S. Thiagarajan, An event structure semantics for general Petri nets, Theoretical Computer Science, vol.153, issue.1-2, pp.129-170, 1993.
DOI : 10.1016/0304-3975(95)00120-4

J. Hopcroft and 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. Howell, P. Jan?ar, and L. Rosier, Completeness Results for Single-Path Petri Nets, Information and Computation, vol.106, issue.2, pp.253-265, 1993.
DOI : 10.1006/inco.1993.1055

O. Ibarra, Reversal-Bounded Multicounter Machines and Their Decision Problems, Journal of the ACM, vol.25, issue.1, pp.116-133, 1978.
DOI : 10.1145/322047.322058

P. Jan?ar, Undecidability of bisimilarity for Petri nets and some related problems, Theoretical Computer Science, vol.148, issue.2, pp.281-301, 1995.
DOI : 10.1016/0304-3975(95)00037-W

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

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

J. Leroux, Vector Addition System Reachability Problem: A Short Self-contained Proof, POPL'11, 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, Lecture Notes in Computer Science, vol.99, issue.1, pp.327-341, 2011.
DOI : 10.1007/3-540-53904-2_94
URL : https://hal.archives-ouvertes.fr/hal-00599757

J. Leroux and G. Sutre, On Flatness for 2-Dimensional Vector Addition Systems with States, CON- CUR'04, pp.402-416, 2004.
DOI : 10.1137/0213029

P. Madhusudan, Model-checking trace event structures, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.371-380, 2003.
DOI : 10.1109/LICS.2003.1210077

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

E. Mayr and A. 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

E. Pelz, Closure properties of deterministic Petri nets, STACS'87, pp.371-382, 1987.
DOI : 10.1007/BFb0039620

M. Praveen, Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier, Lecture Notes in Computer Science, vol.96, issue.1, pp.216-227, 2010.
DOI : 10.1016/0890-5401(92)90059-O

M. Presburger, ¨ Uber die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes Rendus du premier congrès de mathématiciens des Pays Slaves, pp.92-101, 1929.

S. Schulz, First-order logic with reachability predicates on infinite systems, FST&TCS'10, pp.493-504, 2010.

R. Valk and G. Vidal-naquet, Petri nets and regular languages, Journal of Computer and System Sciences, vol.23, issue.3, pp.299-325, 1981.
DOI : 10.1016/0022-0000(81)90067-2