An analyzer for message sequence charts

  • Rajeev Alur
  • Gerard J. Holzmann
  • Doron Peled
Regular Sessions Session 2: Tools I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1055)


Message sequence charts (MSCs) are used in the design phase of a distributed system to record intended system behaviors. They serve as informal documentation of design requirements that are referred to throughout the design process and even in the final system integration and acceptance testing. We show that message sequence charts are open to a variety of semantic interpretations. The meaning of an MSC can depend on, for instance, whether one allows or denies the possibility of message loss or message overtaking, and on the particulars of the message queuing policy to be adopted.

We describe an analysis tool that can perform automatic checks on message sequence charts and can alert the user to the existence of subtle design errors, for any predefined or user-specified semantic interpretation of the chart. The tool can also be used to specify time constraints on message delays, and can then return useful additional timing information, such as the minimum and the maximum possible delays between pairs of events.


  1. [1]
    R. Alur, A. Itai, R.P. Kurshan, M. Yannakakis. Timing verification by successive approximation. Information and Computation 118(1), pp. 142–157, 1995.Google Scholar
  2. [2]
    D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, LNCS 407, pp. 197–212, 1989.Google Scholar
  3. [3]
    R.W. Floyd. Algorithm 97 (Shortest Path). Communications of the ACM 5 (1962), pp. 365.Google Scholar
  4. [4]
    G.J. Holzmann. Design and Validation of Computer Protocols, Prentice Hall Software Series, 1991.Google Scholar
  5. [5]
    ITU-T Recommendation Z.120, Message Sequence Chart (MSC), March 1993. (Includes [7] as Annex B.)Google Scholar
  6. [6]
    P.B. Ladkin, S. Leue. What do message sequence charts mean. In Formal Description Techniques, VI 1994 (FORTE'94), Elsevier, pp. 301–315.Google Scholar
  7. [7]
    S. Mauw, M.A. Reniers. An algebraic semantics of basic message sequence charts. The Computer Journal, 37(4) (1994).Google Scholar
  8. [8]
    J. Ousterhout. Tcl and the Tk toolkit, Addison-Wesley, 1994.Google Scholar
  9. [9]
    C.H. Papadimitriou, K. Steiglitz. Combinatorial Optimization-Algorithms and Complexity, Prentice-Hall, 1982.Google Scholar
  10. [10]
    T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT press, 1990.Google Scholar
  11. [11]
    S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9 (1962), pp. 11–12.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Rajeev Alur
    • 1
  • Gerard J. Holzmann
    • 1
  • Doron Peled
    • 1
  1. 1.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations