Scenarios are powerful tools to model and analyze software systems. However, since they do not provide a complete description of the system, but just some possible execution paths, they are usually integrated with state machines. State machines may be extracted from scenarios using a synthesis process. We could expect that the synthesized state machine model is "equivalent" to the original scenario specification. Instead, it has been proven that it does not always hold, and state machines may introduce unexpected behaviors, called implied scenarios. This paper proves that there is a strict correlation between implied scenarios and non-local branching choices. Based on this result, we propose an approach to identify implied scenarios in High-Level Message Sequence Chart specifications and its application to some specifications. We finally highlight advantages with respect to existent approaches. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Muccini, H. (2003). Detecting implied scenarios analyzing non-local branching choices. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2621, 372–386. https://doi.org/10.1007/3-540-36578-8_26
Mendeley helps you to discover research relevant for your work.