Formal Verification of LSCs in the Development Process

Brill, Matthias; Buschermöhle, Ralf; Damm, Werner; Klose, Jochen; Westphal, Bernd; Wittke, Hartmut

doi:10.1007/978-3-540-27863-4_27

Cited by 12 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…LSCs are an extension of sequence diagrams with special features for modelling liveness requirements. The work [4] proposes validity checking for LSCs by translating them to the temporal logic LTL and checking them against Statemate models. Based on LSCs, the play in play out approach [12] uses a collection of 'played in' examples to specify a whole system, instead of using them only as requirements for an explicit model.…”

Section: Resultsmentioning

confidence: 99%

Checking the Validity of Scenarios in UML Models

Rasch

Wehrheim

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In the UML, sequence diagrams are used to state scenarios, i.e., examples of interactions between objects. As such, sequence diagrams are being developed in the early design phases where requirements on the system are being captured. Their intuitively appealing character and conceptual simplicity makes them an ideal tool for formulating simple properties on a system, even for non-experts. Besides guiding the development of a UML model, sequence diagrams can thus furthermore be used as a starting point for the verification of the UML model. In this paper, we show how the requirements on the system as stated in sequence diagrams can be (semi-automatically) validated for UML models consisting of class diagrams, state machines and structure diagrams. The sequence diagrams that we consider can be universally or existentially quantified or negated, i.e., state scenarios that should always, sometimes or never occur. For validating them in a UML model, we translate both model and sequence diagrams into a formal specification language (the process algebra CSP), and develop procedures for employing the standard CSP model checker (FDR) for checking their validity.

show abstract

Section: Resultsmentioning

confidence: 99%

Checking the Validity of Scenarios in UML Models

Rasch

Wehrheim

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…L SCs support the formal ve rification and sy nthesis of st ate-based systems, as discussed in [8,9]. The syntax and formal semantics of LSCs are presented in [7,10].…”

Section: Motivationmentioning

confidence: 99%

Modeling of Field Artillery Tasks with Live Sequence Charts

Özhan

Oğuztüzün

Evrensel

2008

Journal of Defense Modeling & Simulation

View full text Add to dashboard Cite

This article pr esents a f ormalized co nceptual m odel f or a por tion of the Field Artillery (FA) domain. The structural part of the model identifies the entities in the FA domain along with their properties and associations. The behavioral part of the model d escribes the FA missions in t he l anguage of Li ve S equence Charts (LSCs). The conceptual model is constructed as a metamodel by using the GME (Generic Modeling Environment) toolkit. Once the FA metamodel is loaded, GME automatically provides a cu stomized env ironment t o model particular FA missions. The intended application is to use the FA metamodel as the source for defining model transformations targeting FA federation architectures. This work is also i ntended to help evaluate t he pow er and l imitations of ch art not ations for describing military tasks visually yet precisely.

show abstract

“…That is, similar to precharts, the Büchi criterion isn't used and thus the ACTL/LTL way is practically not relevant. Furthermore, in practice one is typically interested in an example system run that traverses the LSC completely [18] instead of taking a legal exit on a cold condition. To achieve all this, the states of the main-chart TSA are turned into non-accepting states except for the state corresponding to the final cut.…”

Section: Existential Lscsmentioning

confidence: 99%

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

Klose

Toben

Westphal

et al. 2006

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

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

show abstract

Formal Verification of LSCs in the Development Process

Cited by 12 publications

References 15 publications

Checking the Validity of Scenarios in UML Models

Checking the Validity of Scenarios in UML Models

Modeling of Field Artillery Tasks with Live Sequence Charts

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

Contact Info

Product

Resources

About