Automating Scenario Merging

  • Loïc Hélouët
  • Thibaut Hénin
  • Christophe Chevrier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4320)


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.


Partial Order Heuristic Search Sequence Diagram Atomic Action Common Part 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chandy, K.M., Misra, J.: Parallel Program Design, A Foundation. Addison-Wesley, Reading (1988)MATHGoogle Scholar
  2. 2.
    Damm, W., Harel, D.: Live sequence charts: Breathing life into message sequence charts. Journal of System Design (2001)Google Scholar
  3. 3.
    Hélouët, L.: Distributed system requirements modeling with message sequence charts. International Journal of Information and Software Technology (2002)Google Scholar
  4. 4.
    ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (September 1999)Google Scholar
  5. 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
  6. 6.
    Khendek, F., Bochmann, G.V.: Merging behavior specifications. Journal of Formal Methods in System Design 6(3), 259–294 (1995)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Kleitman, D.J., Rotschild, B.L.: Asymptotic enumeration of partial orders. Transactions of the American Mathematical Society 205, 205–220 (1975)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    OMG. Uml superstructure specification, v2.0. OMG Document number formal/05-07-04 (2005)Google Scholar
  10. 10.
    Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  11. 11.
    Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on Message Sequence Charts. Computer Networks and ISDN Systems 28(12), 1629–1641 (1996)CrossRefGoogle Scholar
  12. 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. 13.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1(2) (1972)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Loïc Hélouët
    • 1
  • Thibaut Hénin
    • 2
  • Christophe Chevrier
    • 3
  1. 1.IRISA/INRIARennes CedexFrance
  2. 2.ENS CachanBruz
  3. 3.France Télécom R&DLannionFrance

Personalised recommendations