Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandy, K.M., Misra, J.: Parallel Program Design, A Foundation. Addison-Wesley, Reading (1988)
Damm, W., Harel, D.: Live sequence charts: Breathing life into message sequence charts. Journal of System Design (2001)
Hélouët, L.: Distributed system requirements modeling with message sequence charts. International Journal of Information and Software Technology (2002)
ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (September 1999)
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)
Khendek, F., Bochmann, G.V.: Merging behavior specifications. Journal of Formal Methods in System Design 6(3), 259–294 (1995)
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)
Kleitman, D.J., Rotschild, B.L.: Asymptotic enumeration of partial orders. Transactions of the American Mathematical Society 205, 205–220 (1975)
OMG. Uml superstructure specification, v2.0. OMG Document number formal/05-07-04 (2005)
Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1995)
Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on Message Sequence Charts. Computer Networks and ISDN Systems 28(12), 1629–1641 (1996)
Salah, A., Dssouli, R., Lapalme, G.: Compiling real-time scenarios into a timed automaton. In: Proc. of FORTE 2001, pp. 135–150 (2001)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1(2) (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hélouët, L., Hénin, T., Chevrier, C. (2006). Automating Scenario Merging. In: Gotzhein, R., Reed, R. (eds) System Analysis and Modeling: Language Profiles. SAM 2006. Lecture Notes in Computer Science, vol 4320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951148_5
Download citation
DOI: https://doi.org/10.1007/11951148_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68371-1
Online ISBN: 978-3-540-68373-5
eBook Packages: Computer ScienceComputer Science (R0)