Timed High-Level Message Sequence Charts for Real-Time System Design

  • Tai Hyo Kim
  • Sung Deok Cha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4320)


Existing notations for expressing time constraints in high-level message sequence charts (HMSC) may cause ambiguity when used with HMSC compositions such as alternative and iteration. To overcome such limitation, we propose timed high-level message sequence charts (THMSC) which include an unambiguous subset of time constraints and timed edges as a new complementary notation. THMSC is effective in accurately specifying popular requirement patterns such as watchdog timers and periodic tasks. We present the formal semantics and demonstrate the effectiveness of THMSC using a real-world example that formalizes timing requirements for Korea Multi-Purpose Satellite (KOMPSAT) software.


Time Slot Partial Order Formal Semantic Sequential Composition Parallel Composition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of msc graphs. In: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (2001)Google Scholar
  2. 2.
    Alur, R., Holzmann, G., Peled, D.: An Analyzer for Message Sequence Charts. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Andre, C., Peraldi-Frati, M.A., Rigault, J.P.: Scenario and property checking of real-time systems using a synchronous approach. In: Proceedings of the 4th International Symposium on Object-Oriented Real-Time Distributed Computing (2001)Google Scholar
  4. 4.
    Belachew, M., Shyamasundar, R.K.: MSC+: From Requirement to Prototyped Systems. In: Proceding of the 13th EuroMicro Conference on Real-Time Systems (2001)Google Scholar
  5. 5.
    Ben-Abdallah, H., Leue, S.: Expressing and analyzing timing constraints in message sequence chart specifications. Technical Report 97-04, Dept. of Electrical and Computer Engineering, University of Waterloo (1997)Google Scholar
  6. 6.
    Ben-Abdallah, H., Leue, S.: Syntactic detection of process divergence and non-local choice in message sequence charts. In: Proceedings of the 3rd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (1997)Google Scholar
  7. 7.
    Bontemps, Y., Heymans, P., Schobbens, P.: From live sequence charts to state machines and back: A guided tour. IEEE Transactions on Software Engineering 31(12) (2005)Google Scholar
  8. 8.
    Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)Google Scholar
  9. 9.
    Heymer, S.: A Semantics for MSC based on Petri–Net Components. Technical Report A-00-12, Schriftenreihe der Institute für Informatik/Mathematik, Medical University at Lübeck, Germany (2000)Google Scholar
  10. 10.
    ITU-T. Z120: Message Sequence Charts 2000. ITU-T (2001)Google Scholar
  11. 11.
    Katoen, J.P., Lambert, L.: Pomsets for message sequence charts. In: Proceedings of the 1st Workshop of the SDL Forum Society on SDL and MSC (1998)Google Scholar
  12. 12.
    Korean Aerospace Research Institute (KARI). GX-SDA-001B: KOMPSAT (Korea Multi-Purpose Satellite), Software Requirements Specification (January 1999)Google Scholar
  13. 13.
    Krüger, I.H.: Capturing Overlapping, Triggered, and Preemptive Collaborations Using MSCs. In: Pezzé, M. (ed.) FASE 2003. LNCS, vol. 2621, pp. 387–402. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Krüger, I., Grosu, R., Scholz, P., Broy, M.: From MSCs to Statecharts. Distributed and Parallel Embedded Systems (1999)Google Scholar
  15. 15.
    Ladkin, P.B., Leue, S.: Interpeting message flow graph. Formal Aspects of Computing 7(5) (1995)Google Scholar
  16. 16.
    Lambert, L.: PMSC for Performance Evaluation. In: Proceedings of the 1st Workshop on Performance and Time in SDL/MSC (1998)Google Scholar
  17. 17.
    Li, X., Lilius, J.: Timing analysis of message sequence chart. Technical Report Technical Report 255, Turku Centre for Computer Science TUCS (1999)Google Scholar
  18. 18.
    Maigat, P.L., Helouët, L.: A (max,+) approach for time in message sequence charts. In: Proceedings of the 5th Workshop on Discrete Event Systems (2000)Google Scholar
  19. 19.
    Mauw, S., Reniers, M.A.: Operational Semantics for MSC 1996. Computer Networks and ISDN Systems 35(17) (1999)Google Scholar
  20. 20.
    Pratt, V.: Modeling Concurrency with Partial Orders. International Journal of Parallel Programming 15(1) (1986)Google Scholar
  21. 21.
    Slomka, F., Zant, J., Lambert, L.: MSC-based Schedulability Analysis. In: Proceedings of Workshop on Performance and Time in SDL and MSC (1998)Google Scholar
  22. 22.
    Uchitel, S., Kramer, J., Magee, J.: Synthesis of bahavioral models from scenarios. IEEE Transactions on Software Engineering 29(2) (2003)Google Scholar
  23. 23.
    Zheng, T., Khendek, F.: Time Consistency of MSC 2000 Specifications. Computer Networks 42(3) (2003)Google Scholar
  24. 24.
    Zheng, T., Khendek, F., Helouët, L.: A Semantics for Timed MSC. In: Proceedings of the International Workshop on Validation and Implementation of Scenario Specifications (VISS) (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tai Hyo Kim
    • 1
  • Sung Deok Cha
    • 1
  1. 1.Division of Computer ScienceKorea Advanced Institute of Science and TechnologyDaejeonRepublic of Korea

Personalised recommendations