Minimally adequate teacher synthesizes statechart diagrams Export

@article{citeulike:4312499, abstract = {Abstract.\ \  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.}, author = {M\"{a}kinen, Erkki and Syst\"{a}, Tarja}, citeulike-article-id = {4312499}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s236-002-8033-8}, citeulike-linkout-1 = {http://www.springerlink.com/content/0x447516v7p73673}, day = {1}, doi = {10.1007/s236-002-8033-8}, journal = {Acta Informatica}, keywords = {2002, equivalence, statecharts}, month = {January}, number = {4}, pages = {235--259}, posted-at = {2009-10-03 19:47:34}, priority = {2}, title = {Minimally adequate teacher synthesizes statechart diagrams}, url = {http://dx.doi.org/10.1007/s236-002-8033-8}, volume = {38}, year = {2002} }

TY - JOUR ID - citeulike:4312499 L3 - citeulike-article-id:4312499 N2 - Abstract.   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. IS - 4 JF - Acta Informatica EP - 259 TI - Minimally adequate teacher synthesizes statechart diagrams VL - 38 SP - 235 KW - 2002 KW - equivalence KW - statecharts AU - Mäkinen, Erkki AU - Systä, Tarja PY - 2002/01/01/ UR - http://dx.doi.org/10.1007/s236-002-8033-8 ER -