G. Berthelot, Checking properties of nets using transformation In Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers, pp.19-40, 1986.

B. Bonet, P. Haslum, V. Khomenko, S. Thiébaux, and W. Vogler, Recent advances in unfolding technique, Theoretical Computer Science, vol.551, pp.84-101, 2014.
DOI : 10.1016/j.tcs.2014.07.003

J. Esparza and K. Heljanko, Unfoldings : A Partial-Order Approach to Model Checking . Monographs in Theoretical Computer Science. An EATCS Series, 2008.

J. Engelfriet, Branching processes of Petri nets, Acta Informatica, vol.4, issue.6, pp.575-591, 1991.
DOI : 10.1007/BF01463946

J. Esparza, P. Kanade, and S. Schwoon, A negative result on depth-first net unfoldings, International Journal on Software Tools for Technology Transfer, vol.6, issue.1, pp.161-166, 2008.
DOI : 10.1007/s10009-007-0030-5

J. Esparza and S. Römer, An Unfolding Algorithm for Synchronous Products of Transition Systems, CONCUR'99 Concurrency Theory, pp.2-20, 1999.
DOI : 10.1007/3-540-48320-9_2

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, TACAS, pp.87-106, 1996.
DOI : 10.1007/3-540-61042-1_40

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

K. Heljanko, Minimizing finite complete prefixes, Proceedings of the Workshop Concurrency , Specification & Programming, pp.83-95, 1999.
DOI : 10.1007/3-540-44618-4_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2902

V. Khomenko and M. Koutny, Towards an Efficient Algorithm for Unfolding Petri Nets, CONCUR 2001 -Concurrency Theory, pp.366-380, 2001.
DOI : 10.1007/3-540-44685-0_25

V. Khomenko, M. Koutny, and W. Vogler, Canonical prefixes of Petri net unfoldings, Acta Informatica, vol.40, issue.2, pp.95-118, 2003.
DOI : 10.1007/s00236-003-0122-y

K. H. Lee, J. Favrel, and P. Baptiste, Generalized Petri net reduction method, IEEE Transactions on Systems Man and Cybernetics, vol.17, issue.2, pp.297-303, 1987.

L. Kenneth and . Mcmillan, A technique of state space search based on unfolding. Form, Methods Syst. Des, vol.6, issue.1, pp.45-65, 1995.

T. Murata, Petri nets: Properties, analysis and applications, ICATPN, pp.541-580, 1989.
DOI : 10.1109/5.24143

C. Rodríguez and S. Schwoon, An improved construction of Petri net unfoldings, Proc. of the French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13) Leibniz-Zentrum für Informatik, pp.47-52, 2013.

C. Rodríguez, M. Sousa, S. Sharma, and D. Kroening, Unfolding-based partial order reduction. arXiv preprint, 2015.

M. Sogbohossou and D. Delfieu, Dépliage des réseaux de Petri temporels à modèle sous-jacent non sauf, pp.185-203, 2011.

A. Valmari, Stubborn sets for reduced state space generation, Proceedings of the 10th International Conference on Application and Theory of Petri Nets, pp.1-22, 1989.
DOI : 10.1007/3-540-53863-1_36

F. Vernadat, P. Azéma, and F. Michel, Covering step graph, ICATPN, pp.516-535, 1996.
DOI : 10.1007/3-540-61363-3_28

P. Wolper and P. Godefroid, Partial-order methods for temporal verification, Lecture Notes in Computer Science, vol.715, pp.233-246, 1993.
DOI : 10.1007/3-540-57208-2_17