In *2008 IEEE International Conference on Computational Cybernetics*, pages 151-155, 11, 2008. IEEE.

abstract bibtex

abstract bibtex

Metamodeling techniques have become the subject of research in the last decades. Different approaches of software development emphasize the use of models at all phases of the design and implementation. With metamodels, we can define the concepts of models in concrete domains. Model transformations are used to convert models to other ones. To define rules of transformations, we need to declare, which part of the input models has to be converted. By means of metamodels we can define more complex structures to be matched. In this case we need to find an instance of the defined metamodel in the input graph. The efficiency of the matching algorithms is critical during the application of model transformations. In this paper, a matching algorithm is presented that is able to find all instances of metamodels in arbitrary input models.

@inProceedings{ title = {A Metamodel-Based Matching Algorithm for Model Transformations}, type = {inProceedings}, year = {2008}, identifiers = {[object Object]}, keywords = {Automation,Concrete,Informatics,Mathematical model,Metamodeling,Programming,Unified modeling language,data models,graph grammars,metamodel-based matching algorithm,model transformation,pattern matching,rewriting systems,software development,software engineering}, pages = {151-155}, websites = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4721396}, month = {11}, publisher = {IEEE}, city = {Stara Lesna}, id = {cef61265-8403-35d1-8be5-18de44c574bb}, created = {2015-03-19T13:11:32.000Z}, accessed = {2014-10-29}, file_attached = {false}, profile_id = {6b46cd49-f8a1-3799-91ac-6861cf9a050e}, group_id = {aac22cc4-426b-3b7e-a56d-7d569a62ceed}, last_modified = {2015-03-19T15:03:56.000Z}, read = {false}, starred = {false}, authored = {false}, confirmed = {true}, hidden = {false}, short_title = {Computational Cybernetics, 2008. ICCC 2008. IEEE I}, abstract = {Metamodeling techniques have become the subject of research in the last decades. Different approaches of software development emphasize the use of models at all phases of the design and implementation. With metamodels, we can define the concepts of models in concrete domains. Model transformations are used to convert models to other ones. To define rules of transformations, we need to declare, which part of the input models has to be converted. By means of metamodels we can define more complex structures to be matched. In this case we need to find an instance of the defined metamodel in the input graph. The efficiency of the matching algorithms is critical during the application of model transformations. In this paper, a matching algorithm is presented that is able to find all instances of metamodels in arbitrary input models.}, bibtype = {inProceedings}, author = {Asztalos, Mark and Lengyel, Laszlo}, booktitle = {2008 IEEE International Conference on Computational Cybernetics} }

Downloads: 0