An Automata Based Interpretation of Live Sequence Charts

Harel

Tools and Algorithms for the Construction and Analysis of Systems

et al. 2005

Abstract. We provide semantics for the powerful scenario-based language of live sequence charts (LSCs). We show how the semantics of live sequence charts can be captured using temporal logic. This is done by studying various subsets of the LSC language and providing an explicit translation into temporal logic. We show how a kernel subset of the LSC language (which omits variables, for example) can be embedded within the temporal logic CTL * . For this kernel subset the embedding is a strict inclusion. We show that existential charts can be expressed using the branching temporal logic CTL while universal charts are in the intersection of linear temporal logic and branching temporal logic LTL ∩ CTL. Since our translations are efficient, the work described here may be used in the development of tools for analyzing and executing scenario-based requirements and for verifying systems against such requirements.

Section: Related Workmentioning

confidence: 99%

Temporal Logic for Scenario-Based Specifications

Harel

Tools and Algorithms for the Construction and Analysis of Systems

et al. 2005

“…All the above papers were either theoretical and did not include an implementation, or the synthesis approach was sound but not complete, or the synthesis time complexity was not encouraging. An alternative strategy for synthesis from LSCs is to use a translation from LSCs to temporal logic [18,5] or automata [14] and then apply existing synthesis algorithms, e.g., [25,29].…”

Section: Related Workmentioning

confidence: 99%

Controller Synthesis from LSC Requirements

Plock

Fundamental Approaches to Software Engineering

2009

Abstract. Live Sequence Charts (LSCs) is a visual requirements language for specifying reactive system behavior. When modeling and designing open reactive systems, it is often essential to have a guarantee that the requirements can be satisfied under all possible circumstances. We apply results in the area of controller synthesis to a subset of the LSC language to decide the realizability of LSC requirements. If realizable, we show how to generate system responses that are guaranteed to satisfy the requirements. We discuss one particular implementation of this result which is formulated as an extension of smart play-out, a method for direct execution of scenario-based requirements.

“…Other relevant work appears in [4,26,1,19,29]. In addition, there is the work described in [16], which deals with LSCs, but synthesizes from a single chart only: an LSC is translated into a timed Büchi automaton (from which code can be derived).…”

Section: Related Workmentioning

confidence: 99%

Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements

Harel

Formal Methods in Software and Systems Modeling

2005

Abstract. Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since finding good synthesis algorithms could bring about a major improvement in the reliable development of complex systems. In this paper we describe a methodology for synthesizing statechart models from scenario-based requirements. The requirements are given in the language of live sequence charts (LSCs), and may be played in directly from the GUI, and the resulting statecharts are of the object-oriented variant, as adopted in the UML. We have implemented our algorithms as part of the Play-Engine tool and the generated statechart model can then be executed using existing UML case tools. Abstract. Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since finding good synthesis algorithms could bring about a major improvement in the reliable development of complex systems. In this paper we describe a methodology for synthesizing statechart models from scenario-based requirements. The requirements are given in the language of live sequence charts (LSCs), and may be played in directly from the GUI, and the resulting statecharts are of the object-oriented variant, as adopted in the UML. We have implemented our algorithms as part of the Play-Engine tool and the generated statechart model can then be executed using existing UML case tools.