P. Lem, 46) ExpSpace-c (Corollary 34) Decidable (Th. 51) ExpSpace-h(Lem. 46) ExpSpace-c (Cor. 34) distinctT-PPN Undecidable, Th. 48) ExpSpace-c(Lem. 46) ExpSpace-c (Corollary 35) Undecidable (Th. 47) ExpSpace-h(Lem. 46) ExpSpace-c

. Abdulla, All for the Price of Few, Verification, Model Checking, and Abstract Interpretation, pp.476-495, 2013.
DOI : 10.1007/978-3-642-35873-9_28

. Abdulla, 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

URL : http://www.docs.uu.se/docs/avds/general.ps

N. Abdulla, P. A. Abdulla, and A. Nylén, Better is better than well: on efficient verification of infinite-state systems, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.132-140, 2000.
DOI : 10.1109/LICS.2000.855762

N. Abdulla, P. A. Abdulla, and A. Nylén, Timed Petri Nets and BQOs, Applications and Theory of Petri Nets 2001: 22nd International Conference Proceedings, pp.53-70, 2001.
DOI : 10.1007/3-540-45740-2_5

URL : http://www.it.uu.se/research/docs/fm/apv/tools/tpns/files/bqo.pdf

F. Agerwala, T. Agerwala, and M. Flynn, Comments on capabilities, limitations and " correctness " of petri nets, Proceedings of the 1st Annual Symposium on Computer Architecture, ISCA '73, pp.81-86, 1973.

. Akshay, Combining Free Choice and Time in Petri Nets, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME), pp.120-129, 2016.
DOI : 10.1109/TIME.2016.20

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

. Alur, Parametric real-time reasoning, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.592-601, 1993.
DOI : 10.1145/167088.167242

URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/parametric_real-time_reasoning.pdf

. Aminof, Parameterized model checking of rendezvous systems, CON- CUR 2014 ? Concurrency Theory: 25th International Conference Proceedings, pp.109-124, 2014.

K. Araki, 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

M. Avellaneda, F. Avellaneda, and R. Morin, Vector Addition Systems with States vs. Petri Nets, p.36, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00686444

O. Badouel, E. Badouel, and J. Oliver, Dynamic Changes in Concurrent Systems: Modelling and Verification, p.19, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00072960

. Baier, . Katoen, C. Baier, and J. Katoen, Principles of Model Checking, p.15, 2008.

. Berthomieu, . Diaz, B. Berthomieu, and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Transactions on Software Engineering, vol.17, issue.3, pp.259-273, 1991.
DOI : 10.1109/32.75415

. Bertrand, Distributed local strategies in broadcast networks. report, Inria Rennes Simulation-Based Optimization for the Design of Discrete Event Systems Modeled by Parametric Petri Nets Extending the Racko technique to Ane nets Regular Model Checking Model checking lossy vector addition systems, Fifth UKSim European Symposium on Computer Modeling and Simulation (EMS) LIPIcs -Leibniz International Proceedings in Informatics, 18 Computer Aided Verification , number 1855 in Lecture Notes in Computer Science 16th Annual Symposium on Theoretical Aspects of Computer (STACS'09), pp.150-155, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01170796

R. Boyer, M. Boyer, O. H. Roux, and . Bozga, On the compared expressiveness of arc, place and transition time petri nets Model Checking Ariane-5, Fundamenta Informaticae, vol.88, issue.119, pp.225-249, 2001.

T. Bozzelli, L. Bozzelli, S. L. Torre, and . Browne, Decision problems for lower/upper bound parametric timed automata Formal Methods in System Design Reasoning about networks with many identical finite state processes Information and Computation Exponential Space Complete Problems for Petri Nets and Commutative Semigroups (Preliminary Report) On Parametric PT nets and their Modelling Power A Symbolic Reachability Graph for Coloured Petri Nets, Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, STOC '76 12th International Conference Application and Theory of Petri Nets (ICATPN'91), pp.121-151, 1976.

M. Christensen, S. Christensen, K. H. Mortensen, and . Couvreur, Parametrisation of Coloured Petri Nets Branching Processes of General Petri Nets Discrete parameters in petri nets Discrete parameters in petri nets (informal presentation), Application and Theory of Petri Nets and Concurrency -36th International Conference Proceedings 2nd International Workshop on Synthesis of Complex Parameters, pp.19-129, 1997.

. David, Coverability synthesis in discrete petri nets. (in press), 28th International Conference on Concurrency Theory, CONCUR 2017 Proceedings, p.page to appear, 2017.

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

G. Delzanno, A unified view of parameterized verification of abstract models of broadcast communication, International Journal on Software Tools for Technology Transfer, vol.75, issue.6, pp.475-493, 2016.
DOI : 10.1016/j.scico.2009.07.008

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

E. Desel, J. Desel, and J. Esparza, Free choice Petri nets, p.119, 2005.
DOI : 10.1017/CBO9780511526558

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

. Dufourd, Reset nets between decidability and undecidability, Automata, Languages and Programming, pp.103-115, 1998.
DOI : 10.1007/BFb0055044

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/DFS-icalp98.ps

. Emzivat, Probabilistic Time Petri Nets, Application and Theory of Petri Nets and Concurrency: 37th International Conference, PETRI NETS 2016. Proceedings, pp.261-280, 2016.
DOI : 10.1007/s10703-012-0177-x

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

. Esparza, Parameterized verification of asynchronous shared-memory systems, J. ACM, vol.6310, issue.1, pp.1-10, 2016.

. Figueira, 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

URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FFSS-arxiv10.pdf

A. Finkel and J. Goubault-larrecq, Forward analysis for WSTS, part I: Completions, 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'09), volume 3 of Leibniz International Proceedings in Informatics, pp.433-444, 2009.
DOI : 10.2168/lmcs-8(3:28)2012

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

G. Finkel, A. Finkel, and J. Goubault-larrecq, Forward analysis for WSTS, part II: complete WSTS, Logical Methods in Computer Science, vol.8, issue.3, p.26, 2012.
DOI : 10.2168/lmcs-8(3:28)2012

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

G. Finkel, A. Finkel, and J. Goubault-larrecq, The Theory of WSTS: The Case of Complete WSTS, Application and Theory of Petri Nets: 33rd International Conference, PETRI NETS 2012 Proceedings, pp.3-31, 2012.
DOI : 10.1007/978-3-642-31131-4_2

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

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

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

. Geeraerts, Ê-Petri nets: Algorithms and complexity, Fundam. Inform, vol.137, issue.123, pp.29-60, 2015.

J. Goubault-larrecq, On a Generalization of a Result by Valk and Jantzen, p.95, 2009.

. Gracanin, Fundamentals of parameterized Petri nets Petri net language European commission : Cordis : Projects & results service : Power to the peopleOnline; accessed 18 Ordering by divisibility in abstract algebras On the reachability problem for 5-dimensional vector addition systems, Proceedings Proceedings of the London Mathematical Society, pp.584-591, 1952.

P. Janar-]-janar, K. Jensen, and . Jones, Coloured petri nets In Petri nets: central models and their properties Complexity of some problems in Petri nets Integer Parameter Synthesis for Real-Time Systems Parallel program schemata Decidability of reachability in vector addition systems (preliminary version) The theory of well-quasi-ordering: A frequently discovered concept A structure to decide reachability in petri nets The general vector addition system reachability problem by Presburger inductive invariants Presburger vector addition systems, Information Processing Letters Theoretical Computer Science Proceedings of the fourteenth annual ACM symposium on Theory of computing 24th Annual IEEE Symposium on Logic In Computer Science 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.5-6155, 1969.

A. Marcone and . Marsan, Advances in Petri Nets Fine Analysis of the Quasi-Orderings on the Power Set. Order Modelling with Generalized Stochastic Petri Nets An algorithm for the general petri net reachability problem A Study of the Recoverability of Computing Systems, Parameterized reachability trees for Predicate, pp.301-324339, 1974.

R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.92, p.41, 1980.
DOI : 10.1007/3-540-10235-3

M. L. Minsky, Computation: Finite and Infinite Machines, p.55, 1967.

D. Park, Concurrency and automata on infinite sequences, Theoretical Computer Science: 5th GI-Conference Karlsruhe, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

URL : http://wrap.warwick.ac.uk/47224/1/WRAP_Park_cs-rr-035.pdf

C. A. Petri, Kommunikation mit Automaten, Dissertation, Schriften des IIM 2, Rheinisch-Westfälisches Institut für Instrumentelle Mathematik an der, p.33, 1962.

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

C. Ramchandani, Analysis of asynchronous concurrent systems by timed Petri nets, p.42, 1973.

C. Reutenauer, Aspects mathématiques des réseaux de Petri, p.36, 1989.

. Reynier, P. Servais-]-reynier, and F. Servais, Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning, International Conference on Application and Theory of Petri Nets and Concurrency, pp.69-88, 2011.
DOI : 10.1016/S0022-0000(69)80011-5

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

W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X

URL : https://doi.org/10.1016/s0022-0000(70)80006-x

A. M. Turing, On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London mathematical society, pp.230-265, 1937.

R. Valk, Self-modifying nets, a natural extension of Petri nets, Automata, Languages and Programming, number 62 in Lecture Notes in Computer Science, pp.464-476, 1978.
DOI : 10.1007/3-540-08860-1_35

J. Valk, R. Valk, and M. Jantzen, The residue of vector sets with applications to decidability problems in Petri nets, Acta Informatica, vol.23, issue.6, pp.643-674, 1985.
DOI : 10.1007/BF00289715

. Petri and . Geeraerts, 42 26 ÊPN semantics, p.43, 2015.