Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Timing analysis of MSC specifications with asynchronous concatenation

  • MTM
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

Message Sequence Chart (MSC) is a graphical and textual language for describing the interactions between system components, and MSC specifications (MSSs) are a combination of a set of basic MSCs (bMSCs) and a High-level MSC that describes potentially iterating and branching system behavior by specifying the compositions of basic MSCs, which offer an intuitive and visual way of specifying design requirements. With concurrent, timing, and asynchronous properties, MSSs are amenable to errors, and their analysis is important and difficult. This paper deals with timing analysis of MSC specifications with asynchronous concatenation. For an MSC specification, we require that for any loop, its first node be flexible in execution time and its any associated external timing constraint be enforced on the entire loop. Such an MSC specification is called a flexible loop-closed MSC specification (FLMSS). We show that for FLMSSs, the reachability analysis and bounded delay analysis problems can be solved efficiently by linear programming. The solutions have been implemented into our tool TASS and evaluated by experiments.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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, Z120. Message Sequence Charts. International Telecommunication Union, Standardization Sector, Genève, Switzerland (2000)

  2. Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Proceedings of the 10th International Conference on Concurrency Theory (CONCUR ’99), pp. 114–129. Springer, Berlin (1999)

  3. Alur, R., Holzmann, G.J., Peled, D.: An analyzer for message sequence charts. In: Software-Concepts and Tools, vol. 17, pp. 70–77. Springer, Berlin (1996)

  4. Ben-Abdallah, H., Leue, S.: Timing constraints in message sequence chart specifications. In: Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing and Verification (FORTE/PSTV ’97), pp. 91–106. Chapman & Hall, Ltd, London (1998)

  5. Rumbaugh, J., Jacobson, I., Booch, G. (eds): The Unified Modeling Language reference manual. Addison-Wesley Longman Ltd., Essex (1999)

    Google Scholar 

  6. OMG. UML2.0 Superstructure Specification. http://www.uml.org, Oct. (2005)

  7. Seemann, J., von Gudenberg, J.W.: Extension of uml sequence diagrams for real-time systems. In: Proceedings of the First International Workshop on The Unified Modeling Language (UML ’98), pp. 240–252. Springer, Berlin (1999)

  8. Firley, T., Huhn, M., Diethers, K., Gehrke, T., Goltz, U.: Braunschweig TU. Timed sequence diagrams and tool-based analysis—a case study. In: Proceedings of the Second International Conference on UML (UML ’99), pp. 645–660. Springer, Berlin (1999)

  9. Debbabi M., Hassaïne F., Jarraya Y., Soeanu A.: Verification and Validation in Systems Engineering: Assessing UML/SysML Design Models. Springer, Berlin (2010)

    Google Scholar 

  10. Peled D.A.: Message sequence charts. In: Peled, D.A., Gries, D., Schneider, F.B. (eds) Software Reliability Methods, pp. 300–305. Springer, Berlin (2001)

    Google Scholar 

  11. Li, X., Pan, M., Bu, L., Wang, L., Zhao, J.: Timing analysis of scenario-based specifications using linear programming. In: Software Testing, Verification and Reliability, vol. 22, no.2, pp. 121–143. Wiley InterScience, New York (2012)

  12. Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing (STOC ’84), pp. 302–311. ACM, New York (1984)

  13. Pan, M., Bu, L., Li, X., TASS.: Timing analyzer of scenario-based specifications. In: Proceedings of the 21th International Conference on Computer Aided Verification (CAV2009), pp. 689–695. Springer, Berlin (2009)

  14. Eclipse—The Eclipse Foundation open source community website. http://www.eclipse.org/ (2011). Accessed 26 Sep 2011

  15. TASS: Timing Analyzer of Scenario-based Specifications. http://seg.nju.edu.cn/TASS/ (2011). Accessed 26 Sep 2011

  16. OR-Objects. OR-Objects/index.html. http://1997.opsresearch.com/ (2011). Accessed 26 Sep 2011

  17. Clarke E., Grumberg J., Peled D.: Model Checking. The MIT Press, Cambridge (2000)

    Google Scholar 

  18. Akshay, S., Bollig, B., Gastin, P.: Automata and logics for timed message sequence charts. In: Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS ’07), pp. 290–302. Springer, Berlin (2007)

  19. Li, X., Lilius, J.: Timing analysis of uml sequence diagrams. In: Proceedings of the Second International Conference on UML (UML ’99), pp. 661–674. Springer, Berlin (1999)

  20. Li, X., Lilius, J.: Checking compositions of uml sequence diagrams for timing inconsistency. In: Proceedings of the Seventh Asia-Pacific Software Engineering Conference (APSEC ’00), pp. 154–161. IEEE Computer Society, New York (2000)

  21. Zheng, T., Khendek, F.: Time consistency of MSC-2000 specifications. In: Computer Networks, vol. 42(3), pp. 303–322. Elsevier, Amsterdam (2003)

  22. Akshay, S., Gastin, P., Mukund, M., Narayan Kumar, K.: Model checking time-constrained scenario-based specifications. In: Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10), pp. 204–215. Schloss Dagstuhl, Washington, DC (2010)

  23. Alur, R., David, D.: A theory of timed automata. In: Theoretical Computer Science, vol. 126(2), pp. 183–235. Elsevier, Amsterdam (1994)

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, 210093, People’s Republic of China

    Minxue Pan & Xuandong Li

  2. Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, 210093, People’s Republic of China

    Minxue Pan & Xuandong Li

Authors
  1. Minxue Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xuandong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuandong Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pan, M., Li, X. Timing analysis of MSC specifications with asynchronous concatenation. Int J Softw Tools Technol Transfer 14, 639–651 (2012). https://doi.org/10.1007/s10009-012-0239-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-012-0239-9

Keywords

Search

Navigation