B. Berthomieu and F. Vernadat, State Class Constructions for Branching Analysis of Time Petri Nets, TACAS, pp.442-457, 2003.
DOI : 10.1007/3-540-36577-X_33

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, p.50, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

T. Chatain and C. Jard, Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets, pp.125-145, 2006.
DOI : 10.1007/11767589_8

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

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Proc. Fourth Workshop on Computer-Aided Verification, pp.164-177, 1992.
DOI : 10.1007/3-540-56496-9_14

K. L. Mcmillan, A technique of state space search based on unfolding, Formal Methods in System Design, vol.22, issue.12, pp.45-65, 1995.
DOI : 10.1007/BF01384314

P. M. , M. , and D. J. Farber, Recoverability of communication protocol -implications of theoretical study, IEEE Transactions on Communications, vol.24, pp.1036-1043, 1976.

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

G. J. Sussman, G. L. Steele, and J. , Scheme: An Interpreter for Extended Lambda Calculus MIT AI Lab. AI Lab Memo AIM-349, 1975.