Skip to main content

Race Conditions in Message Sequence Charts

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3780))

Abstract

Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment. The language has been standardised by the ITU and given a formal semantics by means of a process algebra. In this paper, we review a design anomaly, called race condition, in an MSC specification and argue that the current solution correcting race conditions is too weak when implementation is considered. In this paper, we provide an algorithm on partial orders as our solution. The result is a strengthened partial order, which is race-free and remains race-free in the implementation.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Etessami, K., Yannakakis, M.: Inference of Message Sequence Charts. IEEE Transaction on Software Engineering 29, 623–633 (2003)

    Article  Google Scholar 

  2. Alur, R., Holzmann, G.J., Peled, D.: An analyzer for Message Sequence Charts. Software Concepts and Tools 17(2), 70–77 (1996)

    Google Scholar 

  3. Ben-Abdallah, H., Leue, S.: Syntactic detection of process divergence and non-local choice in Message Sequence Charts. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Booch, G., Jacobson, I., Rumbaugh, J.: The Unified Modeling Lan- guage Reference Manual. Addison-Wesley, Reading (1998) ISBN 0-201-30998-x

    Google Scholar 

  5. Broy, M.: On the meaning of Message Sequence Charts. In: Proceedings of the 1st Workshop of the SDL Forum Society Workshop on SDL and MSC, vol. I, pp. 13–34 (1998)

    Google Scholar 

  6. CCITT. CCITT Recommendation Z.120: Message Sequence Chart (MSC). Geneva (1992)

    Google Scholar 

  7. Chen, C., Kalvala, S., Sinclair, J.: A process-based semantics for Message Sequence Charts with data. In: Australian Software Engineering Conference 2005 (ASWEC 2005), Brisbane (March 2005)

    Google Scholar 

  8. Damm, W., Harel, D.: LSCs: Breathing life into Message Sequence Charts. Formal Methods in System Design 19(1), 45–80 (2001)

    Article  MATH  Google Scholar 

  9. Gehrke, T., Huhn, M., Rensink, A., Wehrheim, H.: An alge- braic semantics for Message Sequence Charts documents. In: Formal Description Techniques and Protocol Specification, Testing and Verification (FORTE/PSTV 1998). Kluwer, Dordrecht (1998)

    Google Scholar 

  10. Grabowski, J., Graubmann, P., Rudolph, E.: Towards a Petri net based semantics definition for Message Sequence Charts. In: SDL 1993 Using Objects, Darmstadt. Proceeding of the 6th SDL Forum (1993)

    Google Scholar 

  11. Holzmann, G.J., Peled, D., Redberg, M.H.: Design tools for requirements engineering. Bell Lab Technical Journal 2(1), 86–95 (1997)

    Article  Google Scholar 

  12. ITU-TS. Recommendation Z.120: Message Sequence Chart (MSC). Geneva (1996)

    Google Scholar 

  13. Ladkin, P.B., Leue, S.: Interpreting message flow graphs. Formal Aspects of Computing 7(5), 473–509 (1995)

    Article  MATH  Google Scholar 

  14. Ladkin, P.B., Leue, S.: What do Message Sequence Charts mean? In: Tenney, R.L., Amer, P.D., Uyar, M.U. (eds.) Formal Description Techniques VI, IFIP Transactions C. Proceeding of the 6th International Conference on Formal Description Techniques. North-Holland, Amsterdam (1994)

    Google Scholar 

  15. Mauw, S., Reniers, M.A.: An algebraic semantics of basic Message Sequence Charts. The Computer Journal 37(4), 269–277 (1994)

    Article  Google Scholar 

  16. Mitchell, B.: Inherent causal orderings of partial order scenarios. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 113–127. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Muscholl, A., Peled, D.: Message sequence graphs and decision problems on mazurkiewicz traces. In: MFCS, pp. 81–91 (1999)

    Google Scholar 

  18. Olsen, A., Færgemand, O., Möller Pedersen, B., Reed, R., Smith, J.R.W.: Systems Using SDL 1992. North-Holland, Amsterdam (1994)

    Google Scholar 

  19. Schumann, J., Whittle, J.: Generating statechart designs from scenarios. In: Proceeding of the 22nd International Conference on Software Engineering (2000)

    Google Scholar 

  20. Uchitel, S., Kramer, J., Magee, J.: Synthesis of behavioral models from scenarios. IEEE Transaction on Software Engineering 29(2) (February 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, CA., Kalvala, S., Sinclair, J. (2005). Race Conditions in Message Sequence Charts. In: Yi, K. (eds) Programming Languages and Systems. APLAS 2005. Lecture Notes in Computer Science, vol 3780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575467_14

Download citation

  • DOI: https://doi.org/10.1007/11575467_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29735-2

  • Online ISBN: 978-3-540-32247-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics