R. Alur, G. Holzmann, and D. Peled, An analyzer for message sequence charts, TACAS'96, pp.35-48, 1996.
DOI : 10.1007/3-540-61042-1_37

B. [. Darondeau, L. Genest, and . Hélouët, Products of Message Sequence Charts, FOS- SACS 2008, pp.458-473, 2008.
DOI : 10.1007/978-3-540-78499-9_32
URL : https://hal.archives-ouvertes.fr/inria-00156035

T. Gazagnaire and L. Hélouët, Event Correlation with Boxed Pomsets, FORTE 2007, pp.160-176, 2007.
DOI : 10.1109/87.486338

A. Muscholl and D. Peled, Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces, MFCS'99, pp.81-91, 1999.
DOI : 10.1007/3-540-48340-3_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7078

A. Muscholl and D. Peled, Analyzing Message Sequence Charts, SAM 2000: Proceedings of the 2nd Conference on MSC and SDL. Pp, pp.3-17, 2000.

]. V. Pra86 and . Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, vol.15, issue.1, pp.33-71, 1986.

E. Rudolph, P. Graubmann, and J. Grabowski, Tutorial on Message Sequence Charts, Computer Networks and ISDN Systems, vol.28, issue.12, pp.1629-1641, 1996.
DOI : 10.1016/0169-7552(95)00122-0

P. [. Rehák, J. Slovák, L. Strej?ek, and . Hélouët, Decidable Race Condition for HMSC, 2009.