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

P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez et al., Efficient unfolding of contextual Petri nets, Theoretical Computer Science, vol.449, pp.2-22, 2012.
DOI : 10.1016/j.tcs.2012.04.046
URL : https://hal.archives-ouvertes.fr/hal-00776752

P. Baldan, A. Corradini, and U. Montanari, Contextual Petri Nets, Asymmetric Event Structures, and Processes, Information and Computation, vol.171, issue.1, pp.1-49, 2001.
DOI : 10.1006/inco.2001.3060
URL : https://doi.org/10.1006/inco.2001.3060

A. Benveniste, E. Fabre, S. Haar, and C. Jard, Diagnosis of asynchronous discreteevent systems: a net unfolding approach, IEEE TAC, vol.48, issue.5, pp.714-727, 2003.

E. Best, R. R. Devillers, A. Kiehn, and L. Pomello, Concurrent bisimulations in Petri nets, Acta Informatica, vol.XI, issue.3, pp.231-264, 1991.
DOI : 10.1007/3-540-52282-4_51

C. Dufourd, P. Schnoebelen, and P. Jan?ar, Boundedness of Reset P/T Nets, ICALP, pp.301-310, 1999.
DOI : 10.1007/3-540-48523-6_27

J. Esparza and K. Heljanko, Unfoldings ? A Partial-Order Approach to Model Checking, 2008.

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, pp.285-310, 2002.

S. Hickmott, J. Rintanen, S. Thiébaux, and L. White, Planning via Petri net unfolding, IJCAI, pp.1904-1911, 2007.

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, CAV, pp.164-177, 1993.
DOI : 10.1007/3-540-56496-9_14

U. Montanari and F. Rossi, Contextual nets, Acta Informatica, vol.112, issue.6, pp.545-596, 1995.
DOI : 10.1007/BF01178907

R. J. Van-glabbeek and U. Goltz, Equivalence notions for concurrent systems and refinement of actions, MFCS, pp.237-248, 1989.
DOI : 10.1007/3-540-51486-4_71

R. J. Van-glabbeek and F. W. Vaandrager, Petri net models for algebraic theories of concurrency, PARLE, pp.224-242, 1987.
DOI : 10.1007/3-540-17945-3_13

W. Vogler, Bisimulation and action refinement, Theoretical Computer Science, vol.114, issue.1, pp.173-200, 1993.
DOI : 10.1016/0304-3975(93)90157-O