Compositional Message Sequence Charts (CMSCs) are better to implement than MSCs

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 429-444

  Genest, Blaise ^a,b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMMUNICATING FINITE STATES MACHINES (CFM); COMPOSITIONAL MESSAGE SEQUENCE CHARTS (CMSC); MESSAGE SEQUENCE GRAPHS (MSG); MESSAGE-PASSING ALGORITHMS;

FINITE AUTOMATA;

EID: 24644493427     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_28     Document Type: Conference Paper

References (22)

1. R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In ICALP'01, LNCS 2076, pp.797-808, 2001.
2. R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR'99, LNCS 1664, pp.114-129, 1999.
3. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in MSCs. In TACAS'97, LNCS 1217, pp.259-274, 1997.
4. Nicolas Baudru and Rémi Morin. Safe implementability of regular message sequence chart specifications. In (SNPD'03), pp 210-217. ACIS, 2003.
5. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):pp.323-342, 1983.
6. Blaise Genest, Dietrich Kuske, and Anca Muscholl. A Kleene theorem for a class of communicating automata with effective algorithms, to appear in DLT, LNCS, 2004.
7. B. Genest and A. Muscholl. The structure of local choice in HMSC Internal report LIAFA, 2003 Available at http://www.crans.org/~genest/GM03.ps.
8. B. Genest, M. Minea, A. Muscholl, and D. Peled. Specifying and verifying partial order properties using template MSCs. In FoSSaCS'04, LNCS 2987, pp. 195-210, 2004.
9. B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state High-level MSCs: Model-checking and readability. In ICALP'02, LNCS 2380, pp.657-668, 2002.
10. E. Gunter, A. Muscholl, and D. Peled. Compositional Message Sequence Charts. In International Journal on Software Tools for Technology Transfer (STTT), Volume 5, Springer, 2003.
11. D. Harel and R. Marelly. Come, Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer 2003.
12. Loïc Hélouët and Claude Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th FMICS'00, 2000.
13. J. G. Henriksen, M. Mukund, K. Narayan Kumar, M. Sohoni and P. Thiagarajan. A Theory of Regular MSC Languages To appear In IC, 2004, available at http://www.comp.nus.edu.sg/~thiagu/icregmsc.pdf.
14. ITU-TS recommendation Z.120, Message Sequence Charts, Geneva, 1999.
15. D. Kuske. Regular sets of infinite message sequence charts. In Information and Computation 187, Academic Press, pp.80-109, 2003.
16. M. Lohrey. Safe realizability of High-level Message Sequence Charts. In CONCUR'02, LNCS 2421, pp.177-192, 2002.
17. M. Lohrey and A. Muscholl. Bounded MSC communication In Information and Computation 189, Academic Press, pp. 135-263, 2004.
18. P. Madhusudan and B. Meenakshi. Beyond Message Sequence Graphs In FSTTCS'01, LNCS 2245, pp.256-267, 2001.
19. A. Muscholl and D. Peled. Message Sequence Graphs and decision problems on Mazurkiewicz traces. In MFCS'99, LNCS 1672, pp.81-91, 1999.
20. D. Peled. Specification and verification of Message Sequence Charts. In FORTE/PSTV'00, pp.139-154, 2000.
21. USB 1.1 specification, available at http://www.usb.org/developers/docs/ usbspec.zip
22. Bikram Sengupta and Rance Cleaveland. Triggered Message Sequence Charts. In SIGSOFT 2002/FSE-10. ACM Press, 2002.