Automating Scenario Merging
The design of distributed systems requirements often ends with a collection of redundant use cases or scenarios, each of which illustrating a peculiar functionality or a typical execution of the system. The actual behavior of the system under design can be considered as a superposition of all use cases. However, current scenario languages do not propose such superposition mechanism. An operator for Message Sequence Charts defined as a sum of MSCs was proposed recently. However, the designer must provide explicitly the common parts in operands (called the interface) to compute a sum. This paper proposes an automatic construction of this interface based on a heuristic search.
KeywordsPartial Order Heuristic Search Sequence Diagram Atomic Action Common Part
Unable to display preview. Download preview PDF.
- 2.Damm, W., Harel, D.: Live sequence charts: Breathing life into message sequence charts. Journal of System Design (2001)Google Scholar
- 3.Hélouët, L.: Distributed system requirements modeling with message sequence charts. International Journal of Information and Software Technology (2002)Google Scholar
- 4.ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (September 1999)Google Scholar
- 5.Katoen, J.P., Lambert, L.: Pomsets for message sequence charts. In: Proceedings of SAM98:1st conference on SDL and MSC, Berlin, Juin 1998, pp. 281–290 (1998)Google Scholar
- 7.Klein, J., Caillaud, B., Hélouët, L.: Merging scenarios. In: 9th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), ENTCS, September 2004, vol. 133, pp. 209–226 (2004)Google Scholar
- 9.OMG. Uml superstructure specification, v2.0. OMG Document number formal/05-07-04 (2005)Google Scholar
- 12.Salah, A., Dssouli, R., Lapalme, G.: Compiling real-time scenarios into a timed automaton. In: Proc. of FORTE 2001, pp. 135–150 (2001)Google Scholar
- 13.Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1(2) (1972)Google Scholar