Check It Out: On the Efficient Formal Verification of Live Sequence Charts

  • Jochen Klose
  • Tobe Toben
  • Bernd Westphal
  • Hartmut Wittke
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4144)


Live Sequence Charts (LSCs) are an established visual formalism for requirements in formal, model-based development, in particular aiming at formal verification of the model. The model-checking problem for LSCs is principally long solved as each LSC has an equivalent LTL formula, but even for moderate sized LSCs the formulae grow prohibitively large. In this paper we elaborate on practically relevant sub-classes of LSCs, namely bonded and time bounded, which don’t require the full power of LTL model-checking. For bonded LSCs, a combination of observer automaton and fixed small liveness property and for additionally time bounded LSCs reachability checking is sufficient.


Kripke Structure Outgoing Transition Clock Constraint Message Sequence Chart Negative Normal Form 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Damm, W., Harel, D.: LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design 19, 45–80 (2001)MATHCrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Toben, T., Westphal, B.: On the expressive power of LSCs. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 33–43. Springer, Heidelberg (2006)Google Scholar
  4. 4.
    Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of theor. comp. sc (vol. B): Formal Models And Semantics, pp. 133–191. MIT Press, Cambridge (1990)Google Scholar
  5. 5.
    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
  6. 6.
    Bohn, J., Damm, W., Wittke, H., Klose, J., Moik, A.: 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
  7. 7.
    Schinz, I., Toben, T., Mrugalla, C., Westphal, B.: The Rhapsody UML Verification Environment. In: Cuellar, J.R., Liu, Z. (eds.) Proc. SEFM 2004, pp. 174–183 (2004)Google Scholar
  8. 8.
    Westphal, B.: LSC verification for UML models with unbounded creation and destruction. In: Cook, B., Scott Stoller, W.V. (eds.) Proc. SoftMC 2005. ENTCS, vol. 144:3, pp. 133–145. Elsevier, Amsterdam (2005)Google Scholar
  9. 9.
    Toben, T., Westphal, B.: Concurrent LSC verification. In: Lazic, R. (ed.) Proc. AVoCS 2005. ENTCS, vol. 145, pp. 95–111. Elsevier, Amsterdam (2006)Google Scholar
  10. 10.
    Bunker, A., Gopalakrishnan, G., Slink, 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)Google Scholar
  11. 11.
    Harel, D., Kugler, H., Marelly, R., Pnueli, A.: Smart play-out of behvioral requirements. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 378–398. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Harel, D., Marelly, R.: Come, Let’s Play. Springer, Heidelberg (2003)Google Scholar
  13. 13.
    Sun, J., Dong, J.S.: Model checking Live Sequence Charts. In: ICECCS, pp. 529–538. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  14. 14.
    Grégoire, B.: Automata oriented program verification. Master’s thesis, Facultés Universitaires Notre-Dame de la Paix, Namur (2002)Google Scholar
  15. 15.
    Wittke, H.: A Framework for Specification Verification for Complex Embedded Systems. PhD thesis, C.v.O. Universität Oldenburg (2005)Google Scholar
  16. 16.
    Schlör, R.C.: Symbolic Timing Diagrams: A Visual Formalism for Model Verification. PhD thesis, C.v.O. Universität Oldenburg (2000)Google Scholar
  17. 17.
    Kugler, H., et al.: Temporal logic for scenario-based specifications. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 445–460. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  18. 18.
    Brill, M., et al.: Formal verification of LSCs 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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jochen Klose
    • 3
  • Tobe Toben
    • 1
  • Bernd Westphal
    • 1
  • Hartmut Wittke
    • 2
  1. 1.Fak. II, Dept. für InformatikCarl von Ossietzky Universität OldenburgOldenburgGermany
  2. 2.OSC – ES AGOldenburgGermany
  3. 3.Bombardier TransportationBraunschweigGermany

Personalised recommendations