Skip to main content

A (Max,+) Approach for Time in Message Sequence Charts

  • Chapter
Discrete Event Systems

Abstract

This paper details an approach for studying time in Message Sequence Charts (MSCs). MSCs are first transformed into order automata, and then into (max,+) automata, which allows for the use of well known (max,+) techniques.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Ben-Abdallah and S. Leue. Timing Constraints in Message Sequence Chart Specifications. Proceedings of the Tenth Conference on Formal Description Techniques FORTE/PSTV’97, Osaka, Japan, Nov. 1997, Chapman & Hall.

    Google Scholar 

  2. N. Faltin, L. Lambert, A. Mitschele-Thiel, F. Slomka. PMSC-Integrating Performance into Message Sequence Chart. For-male Beschreibungstechniken für verteilte Systeme, 7. GI/ITG-Fachgespräch, Berlin, Juni 1997.

    Google Scholar 

  3. S. Gaubert, Performance evaluation of (max,+) automata. IEEE transactions on automatic Control, 40(12), Dec 1995.

    Google Scholar 

  4. A. Benveniste, C. Jard, S. Gaubert, “Algebraic techniques for timed systems”. In 9th International Conference on Concurrency Theory, Concur’98, Nice, France, sep. 1998.

    Google Scholar 

  5. P. Kosiuczenko Formalizing Time aspects of Message Sequence Charts. Technical Report Nr. 9703, Ludwig-Maximilians-Universität München, Institut für Informatik, January 1997.

    Google Scholar 

  6. V. Pratt Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, Vol 15, No 1, 1986, pp 33–71

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Slomka, J. Zant, L. Lambert. MSC-based Schedulability Analysis. Workshop on Performance and Time in SDL and MSC. Technical Report 1/98, IMMD VII, University of Erlangen-Nuremberg, Erlangen, February 1998.

    Google Scholar 

  8. J. Cochet-Terrasson, G., Cohen, S., Gaubert, M. McGettrick, J.P. Quadrat, Numerical computation of spectral elements in max-plus algebra, IFAC Conference on System Structure and Control, 1998

    Google Scholar 

  9. ITU, Norm Z.120, Message Sequence Charts.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Le Maigat, P., Hélouët, L. (2000). A (Max,+) Approach for Time in Message Sequence Charts. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4493-7_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7025-3

  • Online ISBN: 978-1-4615-4493-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics