Matching and Merging of Statecharts Specifications
Top Cited Papers
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 29th International Conference on Software Engineering (ICSE'07)
- No. 02705257,p. 54-64
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.Keywords
This publication has 16 references indexed in Scilit:
- A Bayesian approach to diagram matching with application to architectural models2006
- View merging in the presence of incompleteness and inconsistencyRequirements Engineering, 2006
- A generic approach to supporting diagram differencing and merging for collaborative design2005
- Industrial-strength schema matchingACM SIGMOD Record, 2004
- WordNet::Similarity2004
- Matching conceptual graphs as an aid to requirements re-use2002
- A survey of approaches to automatic schema matchingThe VLDB Journal, 2001
- Distributed feature composition: a virtual architecture for telecommunications servicesIEEE Transactions on Software Engineering, 1998
- Exploiting reusable specifications through analogyCommunications of the ACM, 1992
- Results on the propositional μ-calculusTheoretical Computer Science, 1983