An event structure based semantics for high-level message sequence charts

Mathematical Structures in Computer Science

Volumn 12, Issue 4, 2002, Pages 377-402

  Helouet, Loic ^a   Jard, Claude ^b   Caillaud, Benoit ^b  

^a INRIA   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048854140     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003589     Document Type: Article

References (24)

1. Ben-Abdallah, H. and Leue, S. (1997) Syntactic Detection of Process Divergence and non-Local Choice in Message Sequence Charts. In: Brinksma, E. (ed.) Proceedings of the Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems TACAS'97. Springer-Verlag Lecture Notes in Computer Science 1217 259–274.
2. Caillaud, B., Darondeau Helouet, L. and Lesventes, G. (2000) HMSCs as partial specifica-tions…with Petri Nets as completion. INRIA research report no 3970. ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-3970.ps.gz
3. Caucal, D. (1992) On the regular structure of prefix rewriting. Theoretical Computer Science 106 (1) 61–86.
4. Grabowski, J., Graubman, P. and Rudolph, E. (1993) Towards a Petri net based semantics definition for Message Sequence Charts. In: Faergemand, O. and Sarma, A. (eds.) SDL'93 - Using Objects. Proceedings of the sixth SDL Forum, North-Holland 179–190.
5. Habel, A. (1989) Hyperedge replacement: grammars and graphs. In: Goos, G. and Hartmanis, J. (eds.) Springer-Verlag Lecture Notes in Computer Science 643.
6. Hard D. and Damm, W. (1998) LSCs: breathing life into message sequence charts. Weizmann Institute Tech. Report CS98-09.
7. Holzmann, G. J. (1997) The Spin Model Checker. IEEE Trans, on Software Engineering 23 (5) 279–295.
8. ITU-T (1996) Message Sequence Chart (MSC). ITU-T Recommendation Z120.
9. Heymer, S. (1998) A non-interleaving semantics for MSC. Proceedings of SAM98:lst conference on SDL and MSC 281–290.
10. Katoen, J. P. and Lambert, L. (1998) Pomsets for message sequence charts. Proceedings of SAM98:lst conference on SDL and MSC 291.
11. Kosiuczenko, P. (1997) Formalizing MSC’96: Inline expressions. Technical report, Insitute fur Informatik, Munich.
12. Leue, S. and Ladkin, P. (1994) Four issues concerning the semantics of message flow graphs. Technical report, INRIA Lorraine.
13. Leue, S. and Ladkin, P. (1995) Interpreting message flow graphs. Formal Aspects of Computing 7 (5) 473–509.
14. Leue, S. and Ladkin, P. (1994) What do message sequence charts mean? Proceedings of FORTE’93 Formal Description Techniques VI. IFIP Transactions C, North-Holland 301–315.
15. Mauw, S. (1996) The formalization of message sequence charts. Computer Networks and ISDN Systems 28 (12) 1643–1657.
16. Muscholl, A., Peled, D. and Su, Z. (1998) Deciding properties for Message Sequence Charts. Springer-Verlag Lecture Notes in Computer Science 1378 226–241.
17. OMG (1997) Unified Modelling Language 1.1.
18. Pratt, V. (1986) Modelling Concurrency with Partial Orders. International journal of Parallel Programming 15 (1) 33–71.
19. Reniers, M. and Mauw, S. (1994) An algebraic semantics for basic message sequence charts. The Computer Journal 37 (4) 269–277.
20. Reniers, M. and Mauw, S. (1996) High-level message sequence charts. Technical report, Heindoven University of Technology.
21. Reniers, M. (1998) Message Sequence Charts: Syntax and Semantics, Ph.D. Thesis, Heindhoven University of Technology.
22. Rensink, A. and Wehrheim, H. (1994) Weak Sequential Composition in Process Algebras. In: Jon-sson B. and Parrow, J. (eds.) CONCUR ’94: Concurrency Theory, 5th International Conference. Springer-Verlag Lecture Notes in Computer Science 836 226–241.
23. Rudolph, E., Graubmann, P. and Grabowski, J. (1996) Tutorial on Message Sequence Charts (msc’96), Computer Networks and ISDN Systems 28 (12) 1629–1641.
24. Winskel, G., Nielsen, M. and Plotkin, G. (1981) Petri nets, event structures and domains, Part 1. Theoretical Computer Science 13 (1) 85–108.