E. Badouel, L. Bernardinello, and P. Darondeau, The synthesis problem for elementary net systems is NP-complete, Theoretical Computer Science, vol.186, issue.1-2, pp.107-134, 1997.
DOI : 10.1016/S0304-3975(96)00219-8
URL : https://hal.archives-ouvertes.fr/inria-00074122

E. Best and R. R. Devillers, Sequential and concurrent behaviour in Petri net theory, Theoretical Computer Science, vol.55, issue.1, pp.87-136, 1987.
DOI : 10.1016/0304-3975(87)90090-9

E. Best and C. Fernández, Nonsequential processes : a Petri net view, volume 13 of EATCS Monographs on TCS, 1988.
DOI : 10.1007/978-3-642-73483-0

P. Godefroid, Partial-order Methods for the Verification of Concurrent Systems: an Approach to the State-explosion Problem, LNCS, vol.1032, 1996.
DOI : 10.1007/3-540-60761-7

U. Goltz and W. Reisig, The non-sequential behaviour of Petri nets, Information and Control, vol.57, issue.2-3, pp.125-147, 1983.
DOI : 10.1016/S0019-9958(83)80040-0

J. F. Groote and M. P. Sellink, Confluence for process verification. Theoretical computer science, pp.47-81, 1996.

J. Gunawardena, Causal automata, Theoretical Computer Science, vol.101, issue.2, pp.265-288, 1992.
DOI : 10.1016/0304-3975(92)90052-H

H. Hansen and X. Wang, On the Origin of Events: Branching Cells as Stubborn Sets, PETRI NETS 2011, 2011.
DOI : 10.1007/978-3-540-28644-8_31

X. Liu and D. Walker, Partial confluence of processes and systems of objects, Theoretical Computer Science, vol.206, issue.1-2, pp.127-162, 1998.
DOI : 10.1016/S0304-3975(97)00111-4

R. Milner, Concurrency and Communication, 1988.

D. A. Peled, All from one, one for all: on model checking using representatives, Proceedings of the 5th International Conference on Computer Aided Verification, pp.409-423, 1993.
DOI : 10.1007/3-540-56922-7_34

V. Sassone, M. Nielsen, and G. Winskel, Models for concurrency: towards a classification, Theoretical Computer Science, vol.170, issue.1-2, pp.297-348, 1996.
DOI : 10.1016/S0304-3975(96)80710-9

A. Valmari, Stubborn sets for reduced state space generation, ICATPN, pp.491-515, 1989.
DOI : 10.1007/3-540-53863-1_36

R. J. Van-glabbeek and G. D. Plotkin, Configuration structures, event structures and Petri nets, Theoretical Computer Science, vol.410, issue.41, pp.4111-4159, 2009.
DOI : 10.1016/j.tcs.2009.06.014

R. Van-glabbeek and U. Goltz, Refinement of actions and equivalence notions for concurrent systems, Acta Informatica, vol.37, issue.4-5, pp.229-327, 2001.
DOI : 10.1007/s002360000041

R. J. Van-glabbeek and G. D. Plotkin, Event Structures for Resolvable Conflict, MFCS 2004, pp.550-561, 2004.
DOI : 10.1007/978-3-540-28629-5_42

G. Winskel, Event structures, Advances in Petri Nets, pp.325-392, 1987.
DOI : 10.1007/3-540-17906-2_31
URL : https://hal.archives-ouvertes.fr/hal-00148921

G. Winskel and M. Nielsen, Models for concurrency, Handbook of logic in Computer Science, 1995.

A. Yakovlev, M. Kishinevsky, A. Kondratyev, L. Lavagno, and M. Pietkiewicz-koutny, On the models for asynchronous circuit behaviour with OR causality, Formal Methods in System Design, vol.2, issue.no. 3, pp.189-233, 1996.
DOI : 10.1007/BF00122082