Skip to main content
Log in

Analysis and verification of message sequence charts of distributed systems with the help of coloured Petri nets

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The standard language of message sequence charts (MSCs) is designed to describe scenarios of object interaction. Due to their expressiveness and simplicity, MSC diagrams are widely used in practice at all stages of system design and development. In particular, the MSC language is used for describing communication behavior in distributed systems and communication protocols. In this paper, a method for analysis and verification of MSC and HMSC diagrams is considered. The method is based on translation of (H)MSCs into coloured Petri nets. The translation algorithms cover most standard elements of MSCs including data concepts. Size estimates of the CPN, which is the result of translation, are given. Properties of the resulting CPN are analyzed and verified by using the known system CPN Tools and the CPN verifier based on the known tool SPIN. The translation method is demonstrated with an example.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Anureev, I.S., Baranov, S.N., Beloglazov, D.M., Bodin, E.V., Drobintsev, P.D., Kolchin, A.V., Kotlyarov, V.P., Letichevsky, A.A., Letichevsky, A.A., Jr., Nepomniaschy, V.A., Nikiforov, I.V., Potienko, S.V., Pryma, L.V., and Tyutin, B.V., Tools for supporting the integrated technology of analysis and verification of specifications for telecommunication applications, SPIIRAN, 2013, vol. 3, no. 26, p. 349–383.

    Google Scholar 

  2. Stenenko, A.A. and Nepomniaschy, V.A., Verification of coloured Petri nets by model checking method, Preprint of Inst. of Informatics Systems, Sib. Branch, Russ. Akad. Sci., Novosibirsk, 2014, no. 178. http://www.iis. nsk.su/files/preprints/stenenko_nepomniaschy_178.pdf

    Google Scholar 

  3. Chernenok, S.A. and Nepomniaschy, V.A., Analysis of message sequence charts of distributed systems using coloured Petri nets, Preprint of Inst. of Informatics Systems, Sib. Branch, Russ. Akad. Sci., Novosibirsk, 2013, no. 171. http://www.iis.nsk.su/files/preprints/171.pdf

    Google Scholar 

  4. Abdallah, R., Gotlieb, A., Helouet, L., and Jard, C., Scenario realizability with constraint optimization, FASE 2013, LNCS 7793, 2013, p. 194–209.

    Google Scholar 

  5. Chernenok, S.A. and Nepomniaschy, V.A., Analysis and verification of message sequence charts of distributed systems using coloured Petri nets, Proc. of 5th Workshop “PSSV: Theory and Applications,” Moscow, 2014, p. 38–49.

    Google Scholar 

  6. Chernenok, S.A., Analysis and verification of message sequence charts of distributed systems using coloured Petri nets. Appendix. http://bitbucket.org/chernenok/msc-verification

  7. Eichner, C., Fleischhack, H., Meyer, R., Schrimpf, U., and Stehno, S., Compositional semantics for UML 2.0 sequence diagrams using Petri nets, SDL-Forum 2005, LNCS 3530, 2005, p. 133–148.

    Google Scholar 

  8. Genest, B., Muscholl, A., and Peled, D., Message sequence charts, Lectures on Concurrency and Petri Nets, LNCS 3098, 2003, p. 537–558.

    Google Scholar 

  9. ITU-T Recommendation Z.120 (02/2011): Message Sequence Chart (MSC), 2011.

  10. Jensen, K. and Kristensen, L.M., Coloured Petri Nets: Modeling and Validation of Concurrent Systems, Springer, 2009.

    Google Scholar 

  11. Kryvyi, S. and Matvyeyeva, L., Algorithm of translation of MSC-specified system into Petri net, Fundamenta Informaticae, 2007, vol. 79, p. 431–445.

    MathSciNet  Google Scholar 

  12. Letichevsky, A., Kapitonova, J., Letichevsky, A., Jr., Volkov, V., Baranov, S., and Weigert, T., Basic protocols, message sequence charts, and the verification of requirements specifications, Comput. Networks, Int. J. Comput. Telecommun. Networking, 2005, vol. 49, p. 661–675.

    MATH  Google Scholar 

  13. Liang, H., Dingel, J., and Diskin, Z., A comparative survey of scenario-based to state-based model synthesis approaches, SCESM 2006, ACM, New York, 2006, p. 5–12.

    Google Scholar 

  14. Muccini, H., Detecting implied scenarios analyzing non-local branching choices, FASE 2013, LNCS 2621, 2013, p. 372–386.

    Google Scholar 

  15. Ribeiro, O.R. and Fernandes, J.M., Some rules to transform sequence diagrams into coloured Petri nets, 7th Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (CPN 2006), Aarhus, 2006, p. 237–256.

    Google Scholar 

  16. Tanenbaum, A., Computers Networks, Prentice Hall PTR, 2002, ed. 4.

    Google Scholar 

  17. Yang, N., Yu, H., Sun, H., and Qian, Z., Modeling UML sequence diagrams using extended Petri nets, Telecommun. Syst., Springer, 2012, vol. 51, nos. 2–3, pp. 147–158.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. A. Chernenok.

Additional information

Original Russian Text © S.A. Chernenok, V.A. Nepomniaschy, 2014, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2014, No. 6, pp. 94–106.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chernenok, S.A., Nepomniaschy, V.A. Analysis and verification of message sequence charts of distributed systems with the help of coloured Petri nets. Aut. Control Comp. Sci. 49, 484–492 (2015). https://doi.org/10.3103/S0146411615070056

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615070056

Keywords

Navigation