Abstract
Some confusing Message Sequence Charts are identified, that can be considered as syntactically correct, but may lead to ambiguous interpretations. The first kind of MSC identified appears when parallel componentsof a parallel frame synchronize implicitly to continue an execution. The second case is called non-local choice, and appears when more than one instance is responsible for a choice. Non-local choice has already been studied before. This paper provides an extension of the definitions and corresponding detection algorithms. The third case is confluent MSCs, and appears when concurrency is expressed through a choice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur R., Holzmann G., Peled D., An analyzer for Message Sequence Charts, Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), LNCS no 1055, pp 35–48, Passau, Germany, 1996.
Ben-Abdallah H., Leue S., Syntactic Detection of Process Divergence and non-Local Choice in Message Sequence Charts, Proceedingsof TACAS’97, Lecture Notesin Computer Science, Vol. 1217, Brinksma. E editor, Springer-Verlag publisher, pp. 259–274, 1997.
Graubmann P., Rudolph E., Grabowski J., Towards a Petri Net Based Semantics Definition for Message Sequence Charts, In: SDL’93-Using Objects (Editors: O. Faergemand, A. Sarma), North-Holland, October 1993.
Hélouёt L., Jard C., Conditions for synthesis from Message Sequence Charts, 5th international workshop on Formal Methods for Industrial Critical Systems (FMICS), Berlin, April 2000.
ITU-T, Message Sequence Chart (MSC-2000), ITU-T Recommendation Z.120 (11/99), 2000.
Katoen J.P., Lambert L., Pomsets for message sequence charts, proceedings of SAM98:1st conference on SDL and MSC, pp. 291–300, 1998.
Loidl S., Rudolph E., Hinkel U., MSC’96 and Beyond-a Critical Look, Proceedings of the Eight SDL Forum, SDL’97: Time for Testing-SDL MSC and Trends, A. Cavalli and A. Sarma, editors, Evry, France, 23-26 September, 1997.
Mauw S., Reniers M., High-level Message Sequence Charts, Proceedingsof the Eight SDL Forum, SDL’97: Time for Testing-SDL MSC and Trends, pp 291–306, A. Cavalli and A. Sarma, editors, Evry, France, 23-26 September, 1997.
Muscholl A., Peled D., Message sequence graphs and decision problems on Mazurkiewicz traces, Proc. of MFCS’99, Lecture Notesin Computer Science 1672, pp. 81–91, 1999.
Pratt. V, Modeling Concurrency with Partial Orders, International journal of Parallel Programming, Vol. 15, No. 1, pp. 33–71, 1986.
Reniers M., Mauw S., An algebraic semantics for basic message sequence charts, The Computer Journal“, Vol. 37, No. 4, pp. 269–277, 1994.
Reniers M., Message Sequence Charts: Syntax and Semantics, PhD Thesis, Heindhoven University of Technology, 1998.
Tarjan. R, Depth-first search and linear graph algorithms, SIAM Journal of Computing, 1(2), 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hélouёt, L. (2001). Some Pathological Message Sequence Charts, and How to Detect Them. In: Reed, R., Reed, J. (eds) SDL 2001: Meeting UML. SDL 2001. Lecture Notes in Computer Science, vol 2078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48213-X_22
Download citation
DOI: https://doi.org/10.1007/3-540-48213-X_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42281-5
Online ISBN: 978-3-540-48213-0
eBook Packages: Springer Book Archive