The idea of synthesizing statecharts out of a collection of scenarios has received a lot of attention in recent years. However due to the poor expr essive p ower of rst generation scenario languages, including UML1.x sequence diagrams, the propose d solutions often use ad hoc tricks and su er from many shortcomings. The recent adoption in UML2.0 of a richer scenario language, including interesting composition operators, now makes it possible to revisit the problem of statechart synthesis with a radic allynew appro a c h .Inspir ed by the way UML2.0 sequence diagr ams can be algebraically composed, we rst de ne an algebraic framework for composing state charts. Then we show how to leverage the algebraic structure of UML2.0 sequence diagrams to get a direct algorithm for synthesizing a composition of state charts out of them. The synthesized statecharts exhibit inter esting prop erties that make them particularly useful as a basis for the detaile d design process. Beyond o ering a systematic and semantically well founded m e t h o d, another interest of our appr oach lies in its exibility: the modi cation or replac ement of a given scenario has a limited impact on the synthesis pro c ess, thus fostering a b etter traceability between the requirements and the detailed design.
Reference REF defines an algebraic framework for composing state charts and shows how to leverage the algebraic structure of UML sequence diagrams to get a direct algorithm for synthesizing a composition of state charts out of them.
Revisiting statechart synthesis with an algebraic approach
Proceedings. 26th International Conference on Software Engineering
Proceedings. 26th International Conference on Software Engineering
Computer Science