Operational Semantics for MSC'96

Recently, the ITU-standardised specification language Message Sequence Chart has been extended with constructs for more complete and structured specifications. The new version of the language is called MSC'96. Currently, research is performed on the extension of the formal semantics towards a semantics for MSC'96. In this article, we aim at explaining the basic ideas behind the formal semantics. We give formal definitions of parts of the language, but most features are explained by informal examples and drawings. It takes several steps in order to follow the path from an MSC drawing to its formal meaning. First, the drawing must be converted to a concrete textual representation. This conversion is already defined implicitly in Z.120. Next, this syntax is transformed into a formal expression over some process algebra signature. MSC constructs are replaced by appropriate process algebra operators. This transformation is compositional. The operational behaviour of the process algebraic expression can be studied, or the expression can be interpreted into some mathematical model and compared to the interpretation of some other MSC.

[1]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[2]  Sjouke Mauw,et al.  The Formalization of Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[3]  Arend Rensink,et al.  Weak Sequential Composition in Process Algebras , 1994, CONCUR.

[4]  Sjouke Mauw,et al.  Generating tools for Message Sequence Charts , 1995 .

[5]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[6]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[7]  Ekkart Rudolph,et al.  Tutorial on Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[8]  Michel A. Reniers,et al.  An Algebraic Semantics of Basic Message Sequence Charts , 1994, Comput. J..

[9]  M. van Wijk,et al.  A formal semantics of synchronous interworkings , 1993 .

[10]  K. K. Sandhu,et al.  Specification and description language (SDL) , 1992 .

[11]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[12]  Michel A. Reniers,et al.  High-level message sequence charts , 1997, SDL Forum.

[13]  D. Lafeber.  Soil structural concepts , 1966 .

[14]  Jos L. M. Vrancken,et al.  The Algebra of Communicating Processes With Empty Process , 1997, Theor. Comput. Sci..

[15]  Amardeo Sarma,et al.  SDL '95 with MSC in CASE : proceedings of the Seventh SDL Forum, Oslo, Norway, 26-29 September 1995 , 1995 .

[16]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[17]  Ekkart Rudolph,et al.  MSC'96 and beyond - a critical look , 1997, SDL Forum.

[18]  Øystein Haugen.  The MSC-96 distillery , 1997, SDL Forum.

[19]  Øystein Haugen,et al.  Tutorial on Message Sequence Charts (MSC'96) , 2001 .

[20]  Itu-T.  Specification and Description Language (SDL) , 1999 .

[21]  Rajeev Alur,et al.  An Analyzer for Message Sequence Charts , 1996, Softw. Concepts Tools.

[22]  Ana R. Cavalli,et al.  SDL '97 Time for Testing, SDL, MSC and Trends - 8th International SDL Forum, Evry, France, 23-29 September 1997, Proceedings , 1997, SDL Forum.

[23]  Joost Engelfriet,et al.  Determinacy - (Observation Equivalence = Trace Equivalence) , 1985, Theor. Comput. Sci..

[24]  Rajeev Alur,et al.  An Analyser for Mesage Sequence Charts , 1996, TACAS.

[25]  Sjouke Mauw,et al.  Message Sequence Chart (MSC) , 1996 .

[26]  Sjouke Mauw,et al.  An algebraic semantics of message sequence charts , 1994 .

[27]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..