Abstract
Communicating Finite States Machines (CFMs) and Message Sequence Graphs (MSC-graphs for short) are two popular specification formalisms for communicating systems. MSC-graphs capture requirements (scenarios), hence they are the starting point of the design process. Implementing an MSC-graph means obtaining an equivalent deadlock-free CFM, since CFMs correspond to distributed message-passing algorithms. Several partial answers for the implementation have been proposed. E.g., local-choice MSC-graphs form a subclass of deadlock-free CFM: Testing equivalence with some local-choice MSC-graph is thus a partial answer to the implementation problem. Using Compositional MSCs, we propose a new algorithm which captures more implementable models than with MSCs. Furthermore, the size of the implementation is reduced by one exponential.
Chapter PDF
Similar content being viewed by others
References
Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 797–808. Springer, Heidelberg (2001)
Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 114–129. Springer, Heidelberg (1999)
Ben-Abdallah, H., Leue, S.: Syntactic detection of process divergence and non-local choice in MSCs. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 259–274. Springer, Heidelberg (1997)
Baudru, N., Morin, R.: Safe implementability of regular message sequence chart specifications. In: SNPD 2003. ACIS, pp. 210–217 (2003)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2), 323–342 (1983)
Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem for a class of communicating automata with effective algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 30–48. Springer, Heidelberg (2004)
Genest, B., Muscholl, A.: The structure of local choice in HMSC Internal report LIAFA (2003), Available at http://www.crans.org/~genest/GM03.ps
Genest, B., Minea, M., Muscholl, A., Peled, D.: Specifying and verifying partial order properties using template MSCs. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 195–210. Springer, Heidelberg (2004)
Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state High-level MSCs: Model-checking and realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 657–668. Springer, Heidelberg (2002)
Gunter, E., Muscholl, A., Peled, D.: Compositional Message Sequence Charts. International Journal on Software Tools for Technology Transfer (STTT) 5 (2003)
Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)
Hélouët, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: 5th FMICS 2000 (2000)
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.: A Theory of Regular MSC Languages. (to appear) In: IC (2004), http://www.comp.nus.edu.sg/~thiagu/icregmsc.pdf
ITU-TS recommendation Z.120, Message Sequence Charts, Geneva (1999)
Kuske, D.: Regular sets of infinite message sequence charts. In: Information and Computation 187, pp. 80–109. Academic Press, London (2003)
Lohrey, M.: Safe realizability of High-level Message Sequence Charts. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 177–192. Springer, Heidelberg (2002)
Lohrey, M., Muscholl, A.: Bounded MSC communication. In: Information and Computation 189, pp. 135–263. Academic Press, London (2004)
Madhusudan, P., Meenakshi, B.: Beyond Message Sequence Graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 256–267. Springer, Heidelberg (2001)
Muscholl, A., Peled, D.: Message Sequence Graphs and decision problems on Mazurkiewicz traces. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 81–91. Springer, Heidelberg (1999)
Peled, D.: Specification and verification of Message Sequence Charts. In: FORTE/PSTV 2000, pp. 139–154 (2000)
USB 1.1 specification, available at http://www.usb.org/developers/docs/usbspec.zip
Sengupta, B., Cleaveland, R.: Triggered Message Sequence Charts. In: SIGSOFT 2002/FSE-10. ACM Press, New York (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genest, B. (2005). Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs. In: Halbwachs, N., Zuck, L.D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2005. Lecture Notes in Computer Science, vol 3440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31980-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-31980-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25333-4
Online ISBN: 978-3-540-31980-1
eBook Packages: Computer ScienceComputer Science (R0)