An Algebraic Semantics of Basic Message Sequence Charts

Message Sequence Charts are a widely used technique for the visualization of the communications between system components. We present a formal semantics of Basic Message Sequence Charts, exploiting techniques from process algebra. This semantics is based on the semantics of the full language as being proposed for standardization in the International Telecommunication Union.

[1]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[2]  Jozef Hooman,et al.  A Compositional Semantics for Fault-Tolerant Real-Time Systems , 1992, FTRTFT.

[3]  van Hpj Rik Geldrop.  Deriving the Aho-Corasick algorithms : a case study into the synergy of programming methods , 1993 .

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

[5]  Dick Alstein,et al.  Dynamic reconfiguration in distributed hard real-time systems , 1991 .

[6]  J. P. Veltkamp,et al.  On the unavoidability of metastable behaviour , 1993 .

[7]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[8]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[9]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[10]  T Tom Verhoeff,et al.  Quicksort for linked lists , 1993 .

[11]  Bill Roscoe,et al.  An Operational Semantics for CSP , 1986 .

[12]  Kees M. van Hee,et al.  Transforming Functional Database Schemes to Relational Representations , 1992, Specifications of Database Systems.

[13]  Frank S. de Boer,et al.  Asynchronous communication in process algebra , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[14]  L. D. J. C. Loyens,et al.  ILIAS : a sequential language for parallel matrix computations , 1993 .

[15]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[16]  Fairouz Kamareddine,et al.  A unified approach to type theory through a refined lambda-calculus , 1992 .

[17]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[18]  Fairouz Kamareddine,et al.  Non well-foundedness and type freeness can unify the interpretation of functional application , 1992 .

[19]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[20]  T Tom Verhoeff,et al.  A continuous version of the prisoner's dilemma , 1993 .

[21]  Joost-Pieter Katoen,et al.  Parallel programs for the recognition of P-invariant segments , 1991 .

[22]  W. Ferrer,et al.  Abstract reduction and topology , 1993 .

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

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

[25]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

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

[27]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[28]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[29]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[30]  Peter B. Ladkin,et al.  What Do Message Sequence Charts Mean? , 1993, FORTE.