M. Ahuja, A. D. Kshemkalyani, and T. Carlson, A Basic Unit of Computation in Distributed Sytems, Proc. of ICDS'90, pp.12-19, 1990.

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

R. Alur and M. Yannakakis, Model Checking of Message Sequence Charts, Proc. of CONCUR'99, number 1664 in LNCS, pp.114-129, 1999.
DOI : 10.1007/3-540-48320-9_10

B. Bollig, On the Expressiveness of Asynchronous Cellular Automata, FCT, pp.528-539, 2005.
DOI : 10.1007/11537311_46

D. Brand and P. Zafiropoulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, 1981.
DOI : 10.1145/322374.322380

Y. Dalal and C. Sunshine, Connection Management in Transport Protocols, Computer Networks, vol.2, issue.6, pp.454-473, 1978.

P. Darondeau, B. Genest, and L. Hélouet, Products of Message Sequence Charts, FOSSACS 2008, number 4962 in LNCS, pp.459-474, 2008.
DOI : 10.1007/978-3-540-78499-9_32
URL : https://hal.archives-ouvertes.fr/inria-00156035

V. Diekert and G. Rozenberg, The Book of Traces, World Scientific, 1995.
DOI : 10.1142/2563

T. Gazagnaire, Scenario Languages: Using Partial Orders to Model, Verify and Supervize Distributed and Concurrent Systems, 2008.

T. Gazagnaire, B. Genest, L. Hélouët, P. S. Thiagarajan, and S. Yang, Causal Message Sequence Charts, In CONCUR, pp.166-180, 2007.
DOI : 10.1007/978-3-540-74407-8_12
URL : https://hal.archives-ouvertes.fr/inria-00173529

B. Genest, D. Kuske, and A. Muscholl, A Kleene theorem and model checking algorithms for existentially bounded communicating automata, Information and Computation, vol.204, issue.6, pp.920-956, 2006.
DOI : 10.1016/j.ic.2006.01.005
URL : https://hal.archives-ouvertes.fr/hal-00306261

B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun, Infinite-state high-level MSCs: Model-checking and realizability, Journal of Computer and System Sciences, vol.72, issue.4, pp.617-647, 2006.
DOI : 10.1016/j.jcss.2005.09.007
URL : https://hal.archives-ouvertes.fr/hal-00306255

E. Gunter, A. Muscholl, and D. Peled, Compositional Message Sequence Charts, Proc. of TACAS'01, number 2031 in LNCS, 2001.

L. Hélouët and P. L. Maigat, Decomposition of Message Sequence Charts, Proc. of SAM'00, 2000.

I. Itu-ts-recommendation and Z. , Message Sequence Chart (MSC) ITU-TS, 1999.

D. J. Kleitman and B. Rotschild, Asymptotic enumeration of partial orders on a finite set. Transactions of the, pp.205-220, 1975.

D. Kuske, Regular sets of infinite message sequence charts. Information and Computation, pp.80-109, 2003.

R. Morin, Recognizable Sets of Message Sequence Charts, Proc. of STACS'02, number 2285 in LNCS, pp.523-534, 2002.
DOI : 10.1007/3-540-45841-7_43

A. Muscholl and D. Peled, Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces, Proc. of MFCS'99, number 1672 in LNCS, 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, D. Peled, and Z. Su, Deciding Properties for Message Sequence Charts, Proc. of FoSSaCS'98, number 1378 in LNCS, pp.226-242, 1998.
DOI : 10.1007/bfb0053553
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.1861

M. Reniers, Message Sequence Chart: Syntax and Semantics, 1999.

M. Reniers and S. Mauw, High-level Message Sequence Charts, SDL97: Time for Testing -SDL, MSC and Trends, Proc. of the 8th SDL Forum, pp.291-306, 1997.

E. Rudolph, P. Graubman, 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

R. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal of Computing, vol.1, issue.2, 1972.
DOI : 10.1109/swat.1971.10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418