W. M. Van-der-aalst and K. M. Van-hee, Workflow Management: Models, Methods, and Systems, 2002.

W. M. Van-der-aalst, Verification of workflow nets, Lecture Notes in Computer Science, vol.1248, pp.407-426, 1997.
DOI : 10.1007/3-540-63139-9_48

K. M. Van-hee, A. Serebrenik, N. Sidorova, and M. Voorhoeve, Soundness of Resource-Constrained Workflow Nets, Lecture Notes in Computer Science, vol.3536, pp.250-267, 2005.
DOI : 10.1007/11494744_15

G. Juhás, I. Kazlov, and A. Juhásová, Instance Deadlock: A Mystery behind Frozen Programs, Lecture Notes in Computer Science, vol.6128, pp.1-17, 2010.
DOI : 10.1007/978-3-642-13675-7_1

F. Rosa-velardo and D. De-frutos-escrig, Name Creation vs. Replication in Petri Net Systems, Fundam. Inform, vol.88, pp.329-356, 2008.
DOI : 10.1007/978-3-540-73094-1_24

F. Rosa-velardo, D. De-frutos-escrig, and O. M. Alonso, On the Expressiveness of Mobile Synchronizing Petri Nets, Electronic Notes in Theoretical Computer Science, vol.180, issue.1, pp.77-94, 2007.
DOI : 10.1016/j.entcs.2005.05.048

F. Rosa-velardo and D. De-frutos-escrig, Decision problems for petri nets with names, p.3964, 1011.

D. De-frutos-escrig and C. Johnen, Decidability of home space property, 1989.

J. Esparza and M. Nielsen, Decidability issues for petri nets -a survey, Bulletin of the EATCS, vol.52, pp.244-262, 1994.
DOI : 10.7146/brics.v1i8.21662

URL : http://ojs.statsbiblioteket.dk/index.php/brics/article/download/21662/19099

W. Reisig, Petri Nets: An Introduction, Theoretical Computer Science. An EATCS Series, 1985.

P. A. Abdulla and R. Mayr, Minimal Cost Reachability/Coverability in Priced Timed Petri Nets, Lecture Notes in Computer Science, vol.24, issue.2, pp.348-363, 2009.
DOI : 10.1016/j.entcs.2008.12.042

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=