Skip to main content
SpringerLink
Log in

An Algorithm for Checking the Time Consistency of Message Sequence Charts

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The problem of time consistency check of message sequence charts (MSCs) with time specification of events is considered. The analyzed subset of the MSC language includes means of messaging and synchronizing conditions. The necessary and sufficient criterion of the property of time consistency of MSCs and an algorithm for checking this property are given. A prototype of this algorithm is realized in the C++ language.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. ITU-T Recommendation Z.120: Message Sequence Charts (MSCs), ITU Telecommunications Standardization Sector, Geneva (1996).

  2. ITU-T Recommendation Z.120 (11/99): Languages for Telecommunications Applications. Message Sequence Charts (MSCs), ITU-T, Geneva (1996).

  3. M. A. Reniers, “Static semantics of message sequence charts,” Computing Sci. Rep. 96-19, Dep. of Comp. Sci., Eindhoven Univ. of Techn., Eindhoven (1996).

    Google Scholar 

  4. R. Alur, G. J. Holzman, and D. Peled, “An analyzer for message sequence charts,” in: T. Margaria and B. Steffen (eds.), Tools and Algorithms for Construction and Analysis of Systems, LNCS, 1055, Springer Verlag, Heidelberg (1996), pp. 35–48.

    Google Scholar 

  5. H. Ben-Abdallah and S. Leue, “Timing constraints in message sequence chart specification,” in: T. Mizuno, N. Shiratori, T. Higashino, and A. Togashi (eds.), Formal Description Techniques and Protocol Specification, Testing, and Verification, Proc. of FORTE X and PSTV XVII'97 (Osaka), Chapman & Hall, New York (1997), pp. 91–106.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

    A. B. Godlevskii, M. V. Lopatina & S. N. Svirgunenko

Authors
  1. A. B. Godlevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. V. Lopatina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. N. Svirgunenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Godlevskii, A.B., Lopatina, M.V. & Svirgunenko, S.N. An Algorithm for Checking the Time Consistency of Message Sequence Charts. Cybernetics and Systems Analysis 38, 808–817 (2002). https://doi.org/10.1023/A:1022979502087

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022979502087

Search

Navigation