Skip to main content
SpringerLink
Log in
Book cover

Integration of Software Specification Techniques for Applications in Engineering pp 374–399Cite as

Live Sequence Charts

An Introduction to Lines, Arrows, and Strange Boxes in the Context of Formal Verification

  • Chapter

Part of the Lecture Notes in Computer Science book series (LNCS,volume 3147)

Abstract

The language of Message Sequence Charts (MSC) is a well-established visual formalism which is typically used to capture scenarios in the early stages of system development. But when it comes to rigorous requirements capturing, in particular in the context of formal verification, serious deficiencies emerge: MSCs do not provide means to distinguish mandatory and possible behavior, for example to demand that a communication is required to finally occur.

The Live Sequence Chart (LSC) language introduces the distinction between mandatory and possible on the level of the whole chart and for the elements messages, locations, and conditions. Furthermore they provide means to specify the desired activation time by an activation condition or by a whole communication sequence, called pre-chart.

We present the current stage of LSC language and a sketch of its formal semantics in terms of Timed Büchi Automata.

Keywords

  • Formal Semantic
  • Instantaneous Message
  • Atomic Proposition
  • Input Symbol
  • Local Invariant

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This research was supported by the German Research Council (DFG) within the priority program Integration of Specification Techniques with Engineering Applications under grant DA 206/7.

This is a preview of subscription content, access via your institution.

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. ITU-T: ITU-T Recommendation Z.120: Message Sequence Chart (MSC). ITU-T, Geneva (1993)

    Google Scholar 

  2. ITU-T: ITU-T Annex B to Recommendation Z.120: Algebraic Semantics of Message Sequence Charts. ITU-T, Geneva (1995)

    Google Scholar 

  3. Ben-Abdallah, H., Leue, S.: Expressing and analyzing timing constraints in message sequence chart specifications. Technical Report 97-04, Department of Electrical and Computer Engineering, University of Waterloo (1997)

    Google Scholar 

  4. Damm, W., Harel, D.: LSCs: Breathing life into message sequence charts. Formal Methods in System Design 19, 45–80 (2001)

    CrossRef  MATH  Google Scholar 

  5. Klose, J.: Live Sequence Charts: A Graphical Formalism for the Specification of Communication Behavior. PhD thesis, Carl von Ossietzky Universität Oldenburg (2003)

    Google Scholar 

  6. Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering 3 (1977)

    Google Scholar 

  7. Brill, M., Buschermöhle, R., Damm, W., Klose, J., Westphal, B., Wittke, H.: Formal verification of LSC’s in the development process. In: Ehrig, H., Damm, W., Desel, J., Große-Rhode, M., Reif, W., Schnieder, E., Westkämper, E. (eds.) INT 2004. LNCS, vol. 3147, pp. 494–516. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  8. Schlör, R.: Symbolic Timing Diagrams : A Visual Formalism for Model Verification. PhD thesis, Carl von Ossietzky Universität Oldenburg (2000)

    Google Scholar 

  9. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Models and Semantics, vol. B, Elsevier Science Publishers, Amsterdam (1990)

    Google Scholar 

  10. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Models and Semantics, vol. B, pp. 995–1072. Elsevier Science Publishers, Amsterdam (1990)

    Google Scholar 

  11. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183–236 (1994)

    CrossRef  MATH  MathSciNet  Google Scholar 

  12. Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)

    Google Scholar 

  13. Harel, D., Kugler, H.: Synthesizing state-based object systems from LSC specifications. International Journal of Foundations of Computer Science 13, 5–51 (2002)

    CrossRef  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department für Informatik, Carl von Ossietzky Universität Oldenburg, PO Box 2503, 26111, Oldenburg, Germany

    Matthias Brill, Werner Damm & Bernd Westphal

  2. Bombardier Transportation, Braunschweig, Wolfenbüttler Straße 86/Obergstraße 5, 38102, Braunschweig, Germany

    Jochen Klose

  3. OFFIS, Escherweg 2, 26121, Oldenburg, Germany

    Hartmut Wittke

Authors
  1. Matthias Brill
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Damm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jochen Klose
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bernd Westphal
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hartmut Wittke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. OFFIS e.V., Escherweg 2, 26121, Oldenburg, Germany

    Werner Damm

  3. Department of Applied Computer Science, Catholic University of Eichstätt-Ingolstadt,  

    Jörg Desel

  4. Fraunhofer ISST Berlin, Germany

    Martin Große-Rhode

  5. Lehrstuhl für Softwaretechnik und Programmiersprachen Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Wolfgang Reif

  6. Institute for Traffic Safety and Automation Engineering, Technical University of Braunschweig, Braunschweig, Germany

    Eckehard Schnieder

  7. Institute of Industrial Manufacturing and Management (IFF), University of Stuttgart, Nobelstrasse 12, D-70569, Stuttgart, Germany

    Engelbert Westkämper

Rights and permissions

Reprints and Permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brill, M., Damm, W., Klose, J., Westphal, B., Wittke, H. (2004). Live Sequence Charts. In: Ehrig, H., et al. Integration of Software Specification Techniques for Applications in Engineering. Lecture Notes in Computer Science, vol 3147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27863-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27863-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23135-6

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

  • eBook Packages: Springer Book Archive

search

Navigation