S. Haar, Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets, IEEE Transactions on Automatic Control, vol.55, issue.10, pp.2310-2320, 2010.
DOI : 10.1109/TAC.2010.2063490
URL : https://hal.archives-ouvertes.fr/inria-00379540

M. Nielsen, G. D. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2
URL : http://doi.org/10.1016/0304-3975(81)90112-2

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

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

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, Formal Methods in System Design, pp.285-310, 2002.
DOI : 10.1007/3-540-61042-1_40

V. Khomenko, Model checking based on prefixes of Petri net unfoldings, 2003.

W. Vogler, Fairness and partial order semantics, Information Processing Letters, vol.55, issue.1, pp.33-39, 1995.
DOI : 10.1016/0020-0190(95)00049-I

V. Khomenko, M. Koutny, and A. Yakovlev, Detecting state encoding conflicts in STG unfoldings using SAT, Fundam. Inf, vol.62, issue.2, pp.221-241, 2004.

L. Bernardinello, Synthesis of net systems, ICATPN, ser. LNCS, pp.89-105, 1993.
DOI : 10.1007/3-540-56863-8_42

J. Desel and W. Reisig, The synthesis problem of Petri nets, Acta Informatica, vol.254, issue.1, pp.297-315, 1996.
DOI : 10.1007/s002360050046

E. Badouel, B. Caillaud, and P. Darondeau, Distributing Finite Automata Through Petri Net Synthesis, Formal Aspects of Computing, vol.13, issue.6, pp.447-470, 2002.
DOI : 10.1007/s001650200022

J. Carmona, J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno et al., A Symbolic Algorithm for the Synthesis of Bounded Petri Nets, ICATPN, ser. LNCS, pp.92-111, 2008.
DOI : 10.1007/978-3-540-68746-7_10

P. Darondeau, Deriving unbounded Petri nets from formal languages, CONCUR, ser. LNCS, pp.533-548, 1998.
DOI : 10.1007/BFb0055646
URL : https://hal.archives-ouvertes.fr/inria-00073324

R. Bergenthum, J. Desel, R. Lorenz, and S. Mauser, Synthesis of Petri nets from finite partial languages, Fundam. Inform, vol.88, issue.4, pp.437-468, 2008.

A. Ehrenfeucht and G. Rozenberg, Partial (set) 2-structures, Acta Informatica, vol.27, issue.4, pp.315-368, 1989.
DOI : 10.1007/BF00264611

E. Badouel and P. Darondeau, Theory of regions, " in Lectures on Petri Nets I: Basic Models, ser, LNCS, vol.1491, pp.529-586, 1998.

P. Gastin and D. Kuske, Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, Information and Computation, vol.208, issue.7, pp.797-816, 2010.
DOI : 10.1016/j.ic.2009.12.003
URL : https://hal.archives-ouvertes.fr/hal-00779916

W. Penczek, Branching time and partial order in temporal logics, Time and Logic: A Computational Approach, pp.179-228, 1995.