Skip to main content

On the Expressive Power of Live Sequence Charts

  • Chapter

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

Abstract

The Live Sequence Charts (LSC) language is a formally rigorous variant of the well-known scenario language Message Sequence Charts (MSC). LSCs yield expressive power by means to distinguish mandatory and scenario behaviour, means to characterise by another scenario the context in which a specification applies, and means to distinguish required from possible progress, i.e. to require liveness.

From the original proposal by Damm & Harel [1], two slightly different dialects emerged, one in the context of LSC play-in and -out [2] and one for the use of LSCs as formal requirements specification language in formal, model-based approaches to software development [3].

In this paper, we investigate the expressive power of LSCs in the sense of [3]. That is, we first (constructively) show that for each LSC there is an equivalent CTL* formula. Complementing existing work, we show that the containment is strict, that is, not each CTL* formula has an equivalent LSC. To complete the discussion, we present for the first time a way back, from a syntactically characterised fragment of CTL* to the subset of bonded LSC specifications, thereby establishing an equivalence.

This work was partly supported by the German Research Council (DFG) in SFB/TR 14 AVACS and in project DA 206/7-3 (USE), SPP 1064.

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. 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 

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

    Google Scholar 

  3. Klose, J.: Live Sequence Charts: A Graphical Formalism for the Specification of Communication Behavior. PhD thesis, C. v. O. Universität Oldenburg (2003)

    Google Scholar 

  4. Weidenhaupt, K., et al.: Scenarios in system development: Current practice. IEEE Software 15(2), 34–45 (1998)

    Article  Google Scholar 

  5. Amyot, D., Eberlein, A.: An evaluation of scenario notations and construction approaches for telecommunication systems development. Telecommunications Systems Journal 24(1), 61–94 (2003), http://www.site.uottawa.ca/~damyot/pub/index.shtml

    Article  Google Scholar 

  6. Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE’99. Proceedings of the 1999 International Conference on Software Engineering, Los Angeles, CA, USA, May 16-22, 1999, pp. 411–420. ACM Press, New York (1999)

    Google Scholar 

  7. Bitsch, F.: Safety patterns - the key to formal specification of safety requirements. In: Voges, U. (ed.) SAFECOMP 2001. LNCS, vol. 2187, pp. 176–190. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. ITU-T: ITU-T Rec. Z.120: Message Sequence Chart (MSC). ITU-T, Geneva (1999)

    Google Scholar 

  9. Knieke, C., Huhn, M., Goltz, U.: Modelling and simulation of an automotive system using LSCs (0–0 TUM-TR). In: Houmb, S.H., Jürjens, J. (eds.) Proc. CSDUML’2005, Sep. 2005, TUM (2005)

    Google Scholar 

  10. Combes, P., Harel, D., Kugler, H.: Modeling and verification of a telecommunication application using Live Sequence Charts and the Play-Engine tool. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Bunker, A., Gopalakrishnan, G., Slind, K.: Live Sequence Charts applied to hardware requirements specification and verification: A VCI bus interface model. Software Tools for Technology Transfer 7(4), 341–350 (2004), http://www.engineering.usu.edu/ece/faculty/bunker/publications.html

    Article  Google Scholar 

  12. Bontemps, Y., Heymans, P., Kugler, H.: Applying LSCs to the specification of an air traffic control system. In: Proc. SCESM’03 (2003)

    Google Scholar 

  13. Bohn, J., et al.: Modelling and validating train system applications using statemate and live sequence charts. In: Proc. IDPT 2002, Society for Design and Process Science (2002)

    Google Scholar 

  14. Bontemps, Y.: Relating Inter-Agent and Intra-Agent Specifications. PhD thesis, University of Namur, Belgium (2005)

    Google Scholar 

  15. Kugler, H., et al.: Temporal logic for scenario-based specifications. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, Springer, Heidelberg (2005)

    Google Scholar 

  16. Klose, J., et al.: Check it out: On the efficient formal verification of Live Sequence Charts. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 219–233. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Schinz, I., et al.: The Rhapsody UML Verification Environment. In: Cuellar, J.R., Liu, Z. (eds.) Proc. SEFM 2004, Sep. 2004, pp. 174–183 (2004), http://ses.informatik.uni-oldenburg.de/publications.php

  18. Klose, J., Wittke, H.: An automata based interpretation of Live Sequence Charts. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 512–527. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Schlör, R.C.: Symbolic Timing Diagrams: A Visual Formalism for Model Verification. PhD thesis, C. v. O. Universität Oldenburg (2000)

    Google Scholar 

  20. Maidl, M.: The common fragment of ctl and ltl. In: IEEE Symp. on Foundations of Computer Science, pp. 643–652 (2000)

    Google Scholar 

  21. Westphal, B., Toben, T.: The good, the bad and the ugly: Well-formedness of Live Sequence Charts. In: Baresi, L., Heckel, R. (eds.) FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 230–246. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Feyerabend, K., Josko, B.: A visual formalism for real time requirement specification. In: Rus, T., Bertrán, M. (eds.) AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol. 1231, pp. 158–168. Springer, Heidelberg (1997)

    Google Scholar 

  23. Klose, J., Westphal, B.: Relating LSC specifications to UML models. In: Ehrig, H., Grosse-Rhode, M. (eds.) Proc. INT’02 (2002)

    Google Scholar 

  24. Damm, W., Westphal, B.: Live and let die: LSC-based verification of UML-models. Science of of Computer Programming 55(1–3), 117–159 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  25. Barnat, J.: Distributed Memory LTL Model Checking. PhD thesis, Faculty of Informatics, Masaryk University, Brno (2004)

    Google Scholar 

  26. Harel, D.: Personal communication (2005)

    Google Scholar 

  27. Toben, T., Westphal, B.: On the expressive power of LSCs. In: Wiedermann, J., et al. (eds.) Proc. SofSem 2006, vol. 2, Jan. 2006, pp. 33–43. Institute of Computer Science AS, CR, Prague (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Thomas Reps Mooly Sagiv Jörg Bauer

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this chapter

Cite this chapter

Damm, W., Toben, T., Westphal, B. (2007). On the Expressive Power of Live Sequence Charts. In: Reps, T., Sagiv, M., Bauer, J. (eds) Program Analysis and Compilation, Theory and Practice. Lecture Notes in Computer Science, vol 4444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71322-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71322-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71315-9

  • Online ISBN: 978-3-540-71322-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics