TY - GEN
T1 - Compositional message sequence charts
AU - Gunter, Elsa L.
AU - Muscholl, Anca
AU - Peled, Doron A.
PY - 2001
Y1 - 2001
N2 - Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying infinite scenarios and different choices. Specifically, an HMSC consists of a graph, where each node is a finite MSC with matched send and receive events, and vice versa. In this paper we demonstrate a weakness of HMSCs, which disallows one to model certain interactions. We will show, by means of an example, that some simple finite state and simple communication protocol cannot be represented using HMSCs. We then propose an extension to the MSC standard, which allows HMSC nodes to include unmatched messages. The corresponding graph notation will be called HCMSC, which stands for High level Compositional Message Sequence Charts. With the extended framework, we provide an algorithm for automatically constructing an MSC representation for finite state asynchronous message passing protocols.
AB - Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying infinite scenarios and different choices. Specifically, an HMSC consists of a graph, where each node is a finite MSC with matched send and receive events, and vice versa. In this paper we demonstrate a weakness of HMSCs, which disallows one to model certain interactions. We will show, by means of an example, that some simple finite state and simple communication protocol cannot be represented using HMSCs. We then propose an extension to the MSC standard, which allows HMSC nodes to include unmatched messages. The corresponding graph notation will be called HCMSC, which stands for High level Compositional Message Sequence Charts. With the extended framework, we provide an algorithm for automatically constructing an MSC representation for finite state asynchronous message passing protocols.
UR - http://www.scopus.com/inward/record.url?scp=84903159515&partnerID=8YFLogxK
U2 - 10.1007/3-540-45319-9_34
DO - 10.1007/3-540-45319-9_34
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84903159515
SN - 3540418652
SN - 9783540418658
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 496
EP - 511
BT - Tools and Algorithms for the Construction and Analysis of Systems - 7th Int. Conf., TACAS 2001, Held as Part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2001, Proc.
A2 - Margaria, Tiziana
A2 - Yi, Wang
PB - Springer Verlag
T2 - 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001
Y2 - 2 April 2001 through 6 April 2001
ER -