Check it out: on the efficient formal verification of live sequence charts

  • Authors:
  • Jochen Klose;Tobe Toben;Bernd Westphal;Hartmut Wittke

  • Affiliations:
  • Bombardier Transportation, Braunschweig, Germany;Fak. II, Dept. für Informatik, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany;Fak. II, Dept. für Informatik, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany;OSC – ES AG, Oldenburg, Germany

  • Venue:
  • CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.