Abstract
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.
Most of the work was completed during the author’s employment at Lehrstuhl für Informatik II, Aachen University of Technology, Germany.
Chapter PDF
Similar content being viewed by others
References
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.
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.
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.
Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised Regular MSC Languages. Technical Report AIB-03-2002, RWTH Aachen, January 2002.
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.
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.
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.
ITU-TS. ITU-TS Recommendation Z.120anb: Formal Semantics of Message Sequence Charts. Technical report, ITU-TS, Geneva, 1998.
ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99). Technical report, ITU-TS, Geneva, 1999.
Michael Kaminski and Nissim Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329–363, November 1994.
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.
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.
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.
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.
WiesLlaw Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications, 21:99–135, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bollig, B., Leucker, M., Noll, T. (2002). Generalised Regular MSC Languages. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive