Merging Scenarios

Authors:
Jacques Klein;Benoit Caillaud;Loïc Hélouët
Affiliations:
IRISA/INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France;IRISA/INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France;IRISA/INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 1

Tutorial on message sequence charts

Computer Networks and ISDN Systems - Special issue on SDL and MSC
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Compositional Message Sequence Charts

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Refinement in Interworkings

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Dynamic Message Sequence Charts

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine

Come, Let's Play: Scenario-Based Programming Using LSC's and the Play-Engine

Towards a model based approach for integration testing

SDL'11 Proceedings of the 15th international conference on Integrating System and Software Modeling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a merge operator for behavioral requirements expressed by Message Sequence Charts and shows how this product can be systematically used to integrate new behaviors in an existing one. First the merge operator is defined as a fibered product of scenario descriptions. This product is then used to integrate a consensus mechanism to solve the non-local choice problem.