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. Esparza and K. Heljanko, Unfoldings -a partial-order approach to model checking, EATCS Monographs in Theoretical Computer Science, 2008.

D. Delfieu and M. Sogbohossou, An algebra for branching processes, 2013 International Conference on Control, Decision and Information Technologies (CoDIT), pp.625-634, 2013.
DOI : 10.1109/CoDIT.2013.6689616
URL : https://hal.archives-ouvertes.fr/hal-01111131

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, 1996.
DOI : 10.1007/3-540-61042-1_40

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

C. A. Hoare, Communicating sequential processes. Prentice-hall Englewood Cliffs, 1985.

R. Milner, Communication and concurrency. Prentice-hall Englewood Cliffs, 1989.

C. A. Petri, Communication with automata, 1962.

R. Glabbeek and F. Vaandrager, Petri net models for algebraic theories of concurrency, Lecture Notes in Computer Science, vol.259, pp.224-242, 1987.
DOI : 10.1007/3-540-17945-3_13

E. Best, R. Devillers, and M. Koutny, The Box Algebra=Petri Nets+Process Expressions, Information and Computation, vol.178, issue.1, pp.44-100, 2002.
DOI : 10.1016/S0890-5401(02)93117-2

M. Felleisen, R. Findler, and M. Flatt, Semantics Engineering With PLT Redex, 2009.

M. Nielsen, G. Plotkin, G. Winskel, and T. Theor, Petri nets, event structures and domains, Comp. Sci, vol.13, issue.1, pp.89-118, 1981.
DOI : 10.1007/BFb0022474

J. Baeten, J. Bergstra, and J. Klop, An operational semantics for process algebra, CWI Report CSR8522, 1985.

G. Boudol and I. Castellani, On the semantics of concurrency: Partial orders and transition systems, Rapports de Recherche No 550, 1986.
DOI : 10.1007/3-540-17660-8_52
URL : https://hal.archives-ouvertes.fr/inria-00076004

V. Glaabeek and F. Vaandrager, Petri nets for algebraic theories of concurrency, 1987.

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

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

G. L. Steele, Common LISP: the language. Digital press, 1990.