A hierarchy of communication models for message sequence charts

  • Authors:
  • A. G. Engels;S. Mauw;M. A. Reniers

  • Affiliations:
  • Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (TU/e), P.O. Box 513, MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (TU/e), P.O. Box 513, MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (TU/e), P.O. Box 513, MB Eindhoven, The Netherlands

  • Venue:
  • Science of Computer Programming
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

In a Message Sequence Chart (MSC) the dynamical behaviour of a number of cooperating entities is depicted. An MSC defines a partial order on the communication events between these entities. This order determines the physical architecture needed for implementing the specified behaviour, such as a FIFO buffer between each of the entities. In a systematic way, we define 50 communication models for MSC and we define what it means for an MSC to be implementable by such a model Some of these models turn out to be equivalent, in the sense that they implement the same class of MSCs. After analysing the notion of implementability, only ten classes remain, for which we develop a hierarchy. We also develop algorithms to check whether a given MSC belongs to such a class.