Some pathological message sequence charts, and how to detect them

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2078, Issue , 2001, Pages 348-364

  Hélouët, Loïc ^a  

^a ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DETECTION ALGORITHM; MESSAGE SEQUENCE CHARTS; NON-LOCAL CHOICE; PARALLEL COMPONENT; PARALLEL FRAMES;

FLOWCHARTING;

EID: 84958959237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48213-X_22     Document Type: Conference Paper

References (13)

1. 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.
2. 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.
3. 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.
4. Helouet L., Jard C., Conditions for synthesis fromMessage Sequence Charts, 5th international workshop on Formal Methods for Industrial Critical Systems (FMICS), Berlin, April 2000.
5. ITU-T, Message Sequence Chart (MSC-2000), ITU-T Recommendation Z.120 (11/99), 2000.
6. Katoen J.P., Lambert L., Pomsets for message sequence charts, proceedingsof SAM98:1st conference on SDL and MSC, pp. 291-300, 1998.
7. 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.
8. 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.
9. 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.
10. Pratt V, Modeling Concurrency with Partial Orders, International journal of Parallel Programming, Vol. 15, No. 1, pp. 33-71, 1986.
11. Reniers M., Mauw S., An algebraic semantics for basic message sequence charts, The Computer Journal”, Vol. 37, No. 4, pp. 269-277, 1994.
12. Reniers M., Message Sequence Charts: Syntax and Semantics, PhD Thesis, Heindhoven University of Technology, 1998.
13. Tarjan R, Depth-first search and linear graph algorithms, SIAM Journal of Computing, 1(2), 1992