Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Scenarios in System Development: Current Practice
IEEE Software
An Automata Based Interpretation of Live Sequence Charts
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Safety Patterns - The Key to Formal Specification of Safety Requirements
SAFECOMP '01 Proceedings of the 20th International Conference on Computer Safety, Reliability and Security
A Visual Fomalism for Real-Time Requirement Specifications
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
The common fragment of CTL and LTL
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
Live and let die: LSC based verification of UML models
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
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
Check it out: on the efficient formal verification of live sequence charts
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
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 good, the bad and the ugly: well-formedness of live sequence charts
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Controller Synthesis from LSC Requirements
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Verifying Real-Time Systems against Scenario-Based Requirements
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Some results on the expressive power and complexity of LSCs
Pillars of computer science
Scenario-based verification of real-time systems using Uppaal
Formal Methods in System Design
| Hi-index | 0.00 |
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.