Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
Proceedings of the 24th International Conference on Software Engineering
Formal agent-oriented modeling with UML and graph transformation
Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
HMSCs as Partial Specifications ... with PNs as Completions
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Synthesizing State-Based Object Systems from LSC Specifications
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
HMSCs as partial specifications ... with PNs as completions
Modeling and verification of parallel processes
On the Behavioral Inheritance of State-Based Objects
TOOLS '00 Proceedings of the Technology of Object-Oriented Languages and Systems (TOOLS 34'00)
Assert and negate revisited: modal semantics for UML sequence diagrams
Proceedings of the 2006 international workshop on Scenarios and state machines: models, algorithms, and tools
Hi-index | 0.00 |
Live sequence charts (LSCs) have been defined recently as an extension of message sequence charts (MSCs; or their UML variant, sequence diagrams) for rich inter-object specification. One of the main additions is the notion of universal charts and hot, mandatory behavior, which, among other things, enables one to specify forbidden scenarios. LSCs are thus essentially as expressive as statecharts. This paper deals with synthesis, which is the problem of deciding, given an LSC specification, if there exists a satisfying object system and, if so, to synthesize one automatically. The synthesis problem is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases - whether used formally or informally - and if synthesizable they could lead directly to implementation. Synthesis is considerably harder for LSCs than for MSCs, and we tackle it by defining consistency, showing that an entire LSC specification is consistent iff it is satisfiable by a state-based object system, and then synthesizing a satisfying system as a collection of finite state machines or statecharts.