Minimally adequate teacher synthesizes statechart diagrams

Acta Informatica - Tập 38 - Trang 235-259 - 2002
Erkki Mäkinen1, Tarja Systä2
1Department of Computer and Information Sciences, University of Tampere, P.O. Box 607, 33014 Tampere, Finland (e-mail: [email protected]), , FI
2Software Systems Laboratory, Tampere University of Technology, P.O. Box 553, 33101 Tampere, Finland (e-mail: [email protected]), , FI

Tóm tắt

We consider the problem of synthesizing UML statechart diagrams from sequence diagrams as a language inference problem, and we solve it in Angluin's framework of minimally adequate teacher. The designer has the role of the teacher who answers membership and equivalence queries made by the algorithm. It turns out that there are several natural methods to decrease the number of membership queries needed, and thus, to make the algorithm practically applicable.