%0 Conference Paper %1 nejati_07_matching %A Nejati, Shiva %A Sabetzadeh, Mehrdad %A Chechik, Marsha %A Easterbrook, Steve %A Zave, Pamela %B 29th International Conference on Software Engineering, ICSE 2007 %C ATandT Laboratories-Research, Florham Park, NJ, United States %D 2007 %J Software Engineering, 2007. ICSE 2007. 29th International Conference on %K \_to\_print 2007 statecharts merging \_pdf %P 54--63 %R http://dx.doi.org/10.1109/ICSE.2007.50 %T Matching and merging of statecharts specifications %U http://dx.doi.org/10.1109/ICSE.2007.50 %X Model Management addresses the problem of managing an evolving collection of models, by capturing the relationships between models and providing well-defined operators to manipulate them. In this paper, we describe two such operators for manipulating hierarchical Statecharts: Match, for finding correspondences between models, and Merge, for combining models with respect to known correspondences between them. Our Match operator is heuristic, making use of both static and behavioural properties of the models to improve the accuracy of matching. Our Merge operator preserves the hierarchical structure of the input models, and handles differences in behaviour through parameterization. In this way, we automatically construct merges that preserve the semantics of Statecharts models. We illustrate and evaluate our work by applying our operators to AT&T telecommunication features. \\\\\\\\copyright 2007 IEEE. Art. No.: 4222568 Sponsors: IEEE Computer Society Technical Council on Software Engineering; ACM Special Interest Group on Software Engineering, SIGSOFT

@inproceedings{nejati_07_matching, abstract = {Model Management addresses the problem of managing an evolving collection of models, by capturing the relationships between models and providing well-defined operators to manipulate them. In this paper, we describe two such operators for manipulating hierarchical Statecharts: Match, for finding correspondences between models, and Merge, for combining models with respect to known correspondences between them. Our Match operator is heuristic, making use of both static and behavioural properties of the models to improve the accuracy of matching. Our Merge operator preserves the hierarchical structure of the input models, and handles differences in behaviour through parameterization. In this way, we automatically construct merges that preserve the semantics of Statecharts models. We illustrate and evaluate our work by applying our operators to AT\&T telecommunication features. {\\\\\\\\copyright} 2007 IEEE. Art. No.: 4222568 Sponsors: IEEE Computer Society Technical Council on Software Engineering; ACM Special Interest Group on Software Engineering, SIGSOFT}, added-at = {2009-03-10T04:34:06.000+0100}, address = {ATandT Laboratories-Research, Florham Park, NJ, United States}, author = {Nejati, Shiva and Sabetzadeh, Mehrdad and Chechik, Marsha and Easterbrook, Steve and Zave, Pamela}, biburl = {https://www.bibsonomy.org/bibtex/2fe411bb38e1d2fb43b36e6adefcf6443/leonardo}, citeulike-article-id = {1727337}, doi = {http://dx.doi.org/10.1109/ICSE.2007.50}, interhash = {89efda90012c3e6f6fce9d105b90415b}, intrahash = {fe411bb38e1d2fb43b36e6adefcf6443}, journal = {Software Engineering, 2007. ICSE 2007. 29th International Conference on}, keywords = {\_to\_print 2007 statecharts merging \_pdf}, pages = {54--63}, posted-at = {2007-12-31 15:29:53}, priority = {4}, series = {29th International Conference on Software Engineering, ICSE 2007}, timestamp = {2009-03-10T04:34:06.000+0100}, title = {Matching and merging of statecharts specifications}, url = {http://dx.doi.org/10.1109/ICSE.2007.50}, year = 2007 }