%0 Journal Article %1 heckel_01_how %A Heckel, R. %A Zundorf, A. %D 2001 %J Electronic Notes in Theoretical Computer Science %K metamodel graph_transformation fujaba %N 4 %P 41--51 %R 10.1016/S1571-0661(04)80942-3 %T How to Specify a Graph Transformation Approach: A Meta Model for Fujaba %U http://dx.doi.org/10.1016/S1571-0661(04)80942-3 %V 44 %X Application-oriented approaches to graph transformation provide structural features beyond vertices and edges, like composition in hierarchical graphs, inheritance in object-oriented graphs, multiplicity constraints, etc. Often, these features have a specific dynamic interpretation which requires complex embedding mechanisms and context conditions. For example, the deletion of a compound node usually implies the deletion of its components. In this paper, we propose the use of a meta graph grammar for the definition of such a complex graph transformation approach. A meta graph grammar is a typed graph grammar whose type graph provides a static description of the structure of graphs, rules, and transformations of the approach. This static meta model , which is comparable to the meta model in the UML specification, is extended by a specification of the rule application operator by means of graphical embedding rules , i.e., the productions of the meta graph grammar. These embedding rules allow a concise visual description of the admissible context embeddings of a rule and of the side effects of the rule application on the context. As a case-study, a meta graph grammar for selected features of the object-oriented graph transformation approach Fujaba is given.

@article{heckel_01_how, abstract = {Application-oriented approaches to graph transformation provide structural features beyond vertices and edges, like composition in hierarchical graphs, inheritance in object-oriented graphs, multiplicity constraints, etc. Often, these features have a specific dynamic interpretation which requires complex embedding mechanisms and context conditions. For example, the deletion of a compound node usually implies the deletion of its components. In this paper, we propose the use of a meta graph grammar for the definition of such a complex graph transformation approach. A meta graph grammar is a typed graph grammar whose type graph provides a static description of the structure of graphs, rules, and transformations of the approach. This static meta model , which is comparable to the meta model in the UML specification, is extended by a specification of the rule application operator by means of graphical embedding rules , i.e., the productions of the meta graph grammar. These embedding rules allow a concise visual description of the admissible context embeddings of a rule and of the side effects of the rule application on the context. As a case-study, a meta graph grammar for selected features of the object-oriented graph transformation approach Fujaba is given.}, added-at = {2009-02-11T22:26:53.000+0100}, author = {Heckel, R. and Zundorf, A.}, biburl = {https://www.bibsonomy.org/bibtex/2918841067c96ef32fb90738ddf20b147/leonardo}, citeulike-article-id = {4025245}, doi = {10.1016/S1571-0661(04)80942-3}, interhash = {c0e858566e64b448d191893bc3ec2f1c}, intrahash = {918841067c96ef32fb90738ddf20b147}, issn = {15710661}, journal = {Electronic Notes in Theoretical Computer Science}, keywords = {metamodel graph_transformation fujaba}, month = {July}, number = 4, pages = {41--51}, posted-at = {2009-02-09 11:55:49}, priority = {2}, timestamp = {2009-02-11T22:26:53.000+0100}, title = {How to Specify a Graph Transformation Approach: A Meta Model for Fujaba}, url = {http://dx.doi.org/10.1016/S1571-0661(04)80942-3}, volume = 44, year = 2001 }