A Naive Based Approach for Mapping Two ADL Models
In software engineering, we have identified and described the model correspondence problem. To Describe system architecture and artifacts uses models and diagrams. Models contains series of versions. To understand how versions correspondence are difficult. So, we designed a framework based on Search and Ammolite algorithms, which can cardinally finds the correspondence software models. Models are represented as graphs whose nodes have attributes (name, edge, label, connections). For a given diagram pair, it performs different individual matches such as pair-wise match, Split-Merge Match and Drop match and then combine all matches together to design a ADL model. Every ADL Model has its correspondence score for rating quality candidates. To find best Correspondence among the given ADL models uses Search and Ammolite Algorithms.
