Generalised Regular MSC Languages

  • Benedikt Bollig
  • Martin Leucker
  • Thomas Noll
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2303)


We establish the concept of regularity for languages consisting of Message Sequence Charts (MSCs). To this aim, we formalise their behaviour by string languages and give a natural de.nition of regularity in terms of an appropriate Nerode right congruence. Moreover, we present a class of accepting automata and establish several decidability and closure properties of MSC languages. We also provide a logical characterisation by a monadic second-order logic interpreted over MSCs. In contrast to existing work on regular MSC languages, our approach is neither restricted to a certain class of MSCs nor tailored to a fixed communication medium (such as a FIFO channel). It explicitly allows MSCs with message overtaking and is thus applicable to a broad range of channel types like mixtures of stacks and FIFOs.


  1. 1.
    R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proceedings of the 10th International Conference on Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 114–129. Springer, 1999.Google Scholar
  2. 2.
    João Araújo. Formalizing sequence diagrams. In Proceedings of the OOPSLA’98 Workshop on Formalizing UML. Why? How?, volume 33, 10 of ACM SIGPLAN Notices, New York, 1998. ACM Press.Google Scholar
  3. 3.
    Benedikt Bollig and Martin Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In Claudio Bettini and Angelo Montanari, editors, Proceedings of the Symposium on Temporal Representation and Reasoning (TIME’01), pages 240–248. IEEE Computer Society Press, June 2001.Google Scholar
  4. 4.
    Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised Regular MSC Languages. Technical Report AIB-03-2002, RWTH Aachen, January 2002.Google Scholar
  5. 5.
    Volker Diekert and Yves Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume III. Springer, Berlin-Heidelberg-New York, 1997.Google Scholar
  6. 6.
    Elsa Gunter, Anca Muscholl, and Doron Peled. Compositional message sequence charts. In Tiziana Margaria and Wang Yi, editors, Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), volume 2031 of Lecture Notes in Computer Science, pages 496–511. Springer, April 2001.CrossRefGoogle Scholar
  7. 7.
    J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. Regular collections of message sequence charts. In Proceedings of 25th International Symposium on Mathemtical Foundations of Computer Science (MFCS’2000), volume 1893 of Lecture Notes in Computer Science, pages 405–414. Springer, 2000.Google Scholar
  8. 8.
    ITU-TS. ITU-TS Recommendation Z.120anb: Formal Semantics of Message Sequence Charts. Technical report, ITU-TS, Geneva, 1998.Google Scholar
  9. 9.
    ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99). Technical report, ITU-TS, Geneva, 1999.Google Scholar
  10. 10.
    Michael Kaminski and Nissim Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329–363, November 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Dietrich Kuske. Another step towards a theory of regular MSC languages. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS’02), 2002, Lecture Notes in Computer Science. Springer, 2002.Google Scholar
  12. 12.
    P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science. Springer, 2001.Google Scholar
  13. 13.
    M. Mukund, K. Narayan Kumar, and M. Sohoni. Keeping track of the latest gossip in message-passing systems. Technical Report TCS-95-3, School of Mathematics, SPIC Science Foundation, Madras, India, 1995.Google Scholar
  14. 14.
    Frank Neven, Thomas Schwentick, and Victor Vianu. Towards regular languages over in.nite alphabets. In Proceedings of 26th International Symposium on Mathematical Foundations of Computer Science (MFCS’01), Lecture Notes in Computer Science. Springer, 2001.Google Scholar
  15. 15.
    WiesLlaw Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications, 21:99–135, 1987.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Benedikt Bollig
    • 1
  • Martin Leucker
    • 2
  • Thomas Noll
    • 1
  1. 1.Lehrstuhl für Informatik IIAachen University of Technology (RWTH)Germany
  2. 2.Dept. of Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations