LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Scenarios in System Development: Current Practice
IEEE Software
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine
The Rhapsody UML Verification Environment
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
Telecommunications Systems - Modeling, analysis, design and management
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Temporal logic for scenario-based specifications
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The complexity of live sequence charts
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Polymorphic Scenario-Based Specification Models: Semantics and Applications
MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
On the expressive power of live sequence charts
Program analysis and compilation, theory and practice
Check it out: on the efficient formal verification of live sequence charts
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Polymorphic scenario-based specification models: semantics and applications
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
The Life Sequence Chart (LSC) language is a conservative extension of the well-known visual formalism of Message Sequence Charts. An LSC specification formally captures requirements on the inter-object behaviour in a system as a set of scenarios. As with many languages, there are LSCs which are syntactically correct but insatisfiable due to internal contradictions. The authors of the original publication on LSCs avoid this problem by restricting their discussion to well-formed LSCs, i.e. LSCs that induce a partial order on their elements. This abstract definition is of limited help to authors of LSCs as they need guidelines how to write well-formed LSCs and fast procedures that check for the absence of internal contradictions. To this end we provide an exact characterisation of well-formedness of LSCs in terms of concrete syntax as well as in terms of the semantics-giving automata. We give a fast graph-based algorithm to decide well-formedness. Consequently we can confirm that the results on the complexity of a number of LSC problems recently obtained for the subclass of well-formed LSCs actually hold for the set of all LSCs.