Implementing a Component-Based Tool for Interactive Synthesis of UML Statechart Diagrams

The Unified Modeling Language (UML) has an indisputable role in object-oriented software development. It provides several diagram types viewing a system from different perspectives. Currently available systems have relatively modest tool support for comparing, merging, synthesizing, and slicing UML diagrams based on their semantical relationships. Minimally Adequate Synthesizer (MAS) is a tool that synthesizes UML statechart diagrams from sequence diagrams in an interactive manner. It follows Angluin's framework of minimally adequate teacher to infer the desired statechart diagram with the help of membership and equivalence queries. MAS can also synthesize sequence diagrams into an edited or manually constructed statechart diagram. In this paper we discuss problems related to a practical implementation of MAS and its integration with two existing tools (Nokia TED and Rational Rose) supporting UML-based modeling. We also discuss information exchange techniques that could be used to allow the usage of other CASE tools supporting UML.

[1]  David Harel,et al.  Synthesizing State-Based Object Systems from LSC Specifications , 2000, Int. J. Found. Comput. Sci..

[2]  José L. Balcázar,et al.  Algorithms for Learning Finite Automata from Queries: A Unified View , 1997, Advances in Algorithms, Languages, and Complexity.

[3]  Hans Ulrich Simon,et al.  Learning deterministic finite automata from smallest counterexamples , 1998, SODA '98.

[4]  Erkki Mäkinen,et al.  MAS — an interactive synthesizer to support behavioral modelling in UML , 2001, ICSE.

[5]  Kai Koskimies,et al.  How to make apples from oranges in UML , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[6]  Erkki Mäkinen,et al.  Minimally adequate teacher synthesizes statechart diagrams , 2002, Acta Informatica.

[7]  Mika Siikarla,et al.  xUMLi: Towards a Tool-independent UML Processing Platform , 2002 .

[8]  Manfred Broy,et al.  From MSCs to Statecharts , 1998, DIPES.

[9]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

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

[11]  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).

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

[13]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[14]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

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