Exploring the properties of MSC documents by translating them into Petri nets

  • S. L. Kryvyi
  • O. V. Chugayenko
  • L. E. Matveeva

The paper presents the final version of the algorithm for translating MSC-2000 documents to event-equivalent Petri nets. The input document may include any elements of the MSC-2000 language, assuming that condition element value is not used and sequential composition of MSC diagrams is regarded as strict. The algorithm is implemented as a full-functional prototype and can be used to verify software systems.


Petri nets MSC verification 


  1. 1.
    W. Royce, “Managing the development of large software systems: Concepts and techniques,” in: Proc. IEEE WESCON (1970), pp. 1–9.Google Scholar
  2. 2.
    CMMI Product Team, CMMI for System Engineering/Software Engineering, Version 1.02, Software Engineering Institute, Carnegie Mellon (2000).Google Scholar
  3. 3.
    K. Beck, Extreme Programming Explained: Embrace Change, Addison Wesley Longman, Inc. (2000).Google Scholar
  4. 4.
    A. Cockburn, Agile Software Development, Addison-Wesley, Boston (2001).Google Scholar
  5. 5.
    S. Kryvyy, L. Matvyeyeva, and M. Lopatina, “Automatic modeling and analysis of msc-specified systems,” Fundamenta Informaticae, 67, No. 1–3, 107–120 (2005).MATHMathSciNetGoogle Scholar
  6. 6.
    S. Kryvyy and L. Matvyeyeva, “Algorithm of translation of msc-specified system into Petri net,” Fundamenta Informaticae, 79, No. 3–4, 1–15 (2007).MathSciNetGoogle Scholar
  7. 7.
    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), 376–387.Google Scholar
  8. 8.
    S. Kryvyi, L. Matvyeyeva, and A. Chugaenko, “Converting of MSC documents to Petri Nets,” in: Proc. CS\&P’2008 Workshop (2008), pp. 83–93.Google Scholar
  9. 9.
    ITU-TS Recommendation Z.120: Message Sequence Chart (MSC), Ed. by ITU-TS, ITU-TS, Geneva (2000).Google Scholar
  10. 10.
    ITU-TS Recommendation Z.120 Annex B: Algebraic Semantics of Message Sequence Charts, Ed. by ITU-TS, ITU-TS, Geneva (1998).Google Scholar
  11. 11.
    T. Murata, “Petri nets: Properties, analysis and applications,” in: Proc. IEEE, 77, 541–580 (1989).CrossRefGoogle Scholar
  12. 12.
    S. Krivoi, “Criteria of satisfiability for homogeneous systems of linear diophantine constraints,” in: Lecture Notes in Computer Science. Parallel Processing and Applied Mathematics, 2328, 264–271 (2002).Google Scholar
  13. 13.
    S. L. Kryvyi and A. F. Chugayenko, “Formal methods for analysis of discrete systems using a specification language,” Cybern. Syst. Analysis, 45, No. 4, 528–543 (2009).MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2009

Authors and Affiliations

  • S. L. Kryvyi
    • 1
  • O. V. Chugayenko
    • 2
  • L. E. Matveeva
    • 2
  1. 1.Taras Shevchenko National University of KyivKyivUkraine
  2. 2.V. M. Glushkov Institute of CyberneticsNational Academy of Sciences of UkraineKyivUkraine

Personalised recommendations