Skip to main content

Formal methods for analysis of discrete systems using a specification language

A realization of an algorithm that translates an MSC diagram (an MSC document) into an event equivalent Petri net is described, and the correctness of the algorithm is proved. The net obtained in this way can be used to analyze properties of the original MSC document. The mentioned algorithm is a part of a system designed for verification and analysis of MSC documents.

This is a preview of subscription content, access via your institution.

References

  1. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC), Edited by ITU-TS, ITU-TS, Geneva (2000).

  2. M. Nakamura, Y. Kakuda, and T. Kikuno, “Petri-net based detection method for non-deterministic feature interaction and its experimental evaluation,” Feature Interaction in Telecommunication Networks, No. 4, 138–152 (1997).

  3. O. Kluge, J. Padberg, and H. Ehrig, Model Train Control Systems: From Message Sequence Charts to Petri Nets, Technische Universitat, Berlin (2001).

    Google Scholar 

  4. S. Kryvyy, L. Matvyeyeva, and M. Lopatina, “Automatic modeling and analysis of msc-specified systems,” Fundamenta Informaticae, 67, Nos. 1–3, 107–120 (2005).

    MATH  MathSciNet  Google Scholar 

  5. S. Kryvyy and L. Matvyeyeva, “Algorithm of translation of msc-specified system into Petri net,” Fundamenta Informaticae, 79, Nos. 3–4, 431–445 (2007).

    MATH  MathSciNet  Google Scholar 

  6. S. Kryvyi, L. Matvyeyeva, and A. Chugaenko, “Extension of algorithm of translation of msc-specified system into Petri net,” in: Proc. CS&P’2007 Workshop (2007), pp. 376–387.

  7. A. Chugaenko, “A realization of an algorithm for translation of a collection of MSC diagrams into a Petri net,” USiM, No. 6, 17–23 (2007).

  8. S. Kryvyy and O. Chugayenko, “Extended algorithm for translation of msc diagrams into Petri nets,” Fundamenta Informaticae, 2, No. 1, 68–75 (2008).

    Google Scholar 

  9. V. E. Kotov, Petri Nets [in Russian], Nauka, Moscow (1984).

    MATH  Google Scholar 

  10. T. Murata, “Petri nets: Properties, analysis, and applications,” in: Proc. IEEE, 77, 541–580 (1989).

    Article  Google Scholar 

  11. S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in integer domains,” Cybernetics and Systems Analysis, No. 2, 163–175 (2006).

  12. A. Chugaenko, “A realization of the tss-algorithm,” USiM, No. 4, 14–18 (2007).

  13. ITU-TS Recommendation Z.120. Annex B: Algebraic semantics of Message Sequence Charts, Edited by ITU-TS, ITU-TS, Geneva (1998).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. L. Kryvyi.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 31–56, July–August 2009.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kryvyi, S.L., Chugayenko, A.V. Formal methods for analysis of discrete systems using a specification language. Cybern Syst Anal 45, 528–543 (2009). https://doi.org/10.1007/s10559-009-9121-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-009-9121-5

Keywords

  • Petri nets
  • MSC
  • verification