An Interactive Approach for Synthesizing UML Statechart Diagrams from Sequence Diagrams

Minimally Adequate Synthesizer (MAS) is an interactive algorithm that synthesizes UML statechart diagrams from sequence diagrams. It follows Angluin’s framework of minimally adequate teacher to infer the desired statechart diagram by consulting the user. To minimize the consultations needed, MAS keeps track of the interaction with the user. Together with its general knowledge about sequence diagrams, this allows MAS to operate without user’s help in most of the cases. A synthesized statechart diagram is a generalization, which accepts additional behavior to that described in the sequence diagrams given as input. During the synthesis process MAS asks the user if certain generalizations are allowed or not. We sketch the usage of two different kinds of inaccurate answers the user can provide. We allow Probably yes and Probably no answers, i.e. weak Yes and No answers. The information obtained from these answers is considered less significant than that obtained from normal, definite answers. The user can also postpone answering by saying later.

[1]  Ivar Jacobson,et al.  The unified modeling language reference manual , 2010 .

[2]  Johann Schumann,et al.  Generating statechart designs from scenarios , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[3]  Tarja Systä,et al.  Implementing Minimally Adequate Synthesizer , 2000 .

[4]  Ismaïl Khriss,et al.  Algorithmic support for model transformation in object‐oriented software development , 2001, Concurr. Comput. Pract. Exp..

[5]  Kai Koskimies,et al.  Automated Support for Modeling OO Software , 1998, IEEE Softw..

[6]  Erkki Mäkinen,et al.  Minimally Adequate Teacher Designs Software , 2000 .

[7]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[8]  Mohammad Reza Mousavi,et al.  Synthesizing software architecture descriptions from Message Sequence Chart specifications , 1998, Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239).

[9]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[10]  Jean G. Vaucher,et al.  From scenarios to timed automata: building specifications from users requirements , 1995, Proceedings 1995 Asia Pacific Software Engineering Conference.