R. Alur, T. A. Henzinger, and M. Y. Vardi, 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

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

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, CAV, 2000.
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512

G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad, A symbolic reachability graph for coloured petri nets, Theoretical Computer Science, vol.176, issue.1-2, pp.39-65, 1997.
DOI : 10.1016/S0304-3975(96)00010-2

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

N. D. Jones, L. H. Landweber, and Y. E. Lien, Complexity of some problems in Petri nets, Theoretical Computer Science, vol.4, issue.3, pp.277-299, 1977.
DOI : 10.1016/0304-3975(77)90014-7

M. Richard, R. E. Karp, and . Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.

M. Lindqvist, Parameterized reachability trees for Predicate/Transition nets, Lecture Notes in Computer Science, vol.674, pp.301-324, 1993.
DOI : 10.1007/3-540-56689-9_49

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

L. Marvin and . Minsky, Computation: Finite and Infinite Machines, 1967.