%0 Journal Article %1 lara_07_attributed %A de Lara, Juan %A Bardohl, Roswitha %A Ehrig, Hartmut %A Ehrig, Karsten %A Prange, Ulrike %A Taentzer, Gabriele %B Fundamental Aspects of Software Engineering %D 2007 %J Theoretical Computer Science %K _hardcopy 2007 metamodelling statecharts _folder_2 graph_transformation %N 3 %P 139--163 %R 10.1016/j.tcs.2007.02.001 %T Attributed graph transformation with node type inheritance %U http://dx.doi.org/10.1016/j.tcs.2007.02.001 %V 376 %X The aim of this paper is to integrate typed attributed graph transformation with node type inheritance. Borrowing concepts from object oriented systems, the main idea is to enrich the attributed type graph with an inheritance relation and a set of abstract nodes. In this way, a node type inherits the attributes and edges of all its ancestors. Based on these concepts, it is possible to define abstract productions, containing abstract nodes. These productions are equivalent to a number of concrete productions, resulting from the substitution of the abstract node types by the node types in their inheritance clan. Therefore, productions become more compact and suitable for their use in combination with meta-modelling. The main results of this paper show that attributed graph transformation with node type inheritance is fully compatible with the existing concept of typed attributed graph transformation.

@article{lara_07_attributed, abstract = {The aim of this paper is to integrate typed attributed graph transformation with node type inheritance. Borrowing concepts from object oriented systems, the main idea is to enrich the attributed type graph with an inheritance relation and a set of abstract nodes. In this way, a node type inherits the attributes and edges of all its ancestors. Based on these concepts, it is possible to define abstract productions, containing abstract nodes. These productions are equivalent to a number of concrete productions, resulting from the substitution of the abstract node types by the node types in their inheritance clan. Therefore, productions become more compact and suitable for their use in combination with meta-modelling. The main results of this paper show that attributed graph transformation with node type inheritance is fully compatible with the existing concept of typed attributed graph transformation.}, added-at = {2009-02-11T20:52:36.000+0100}, author = {de Lara, Juan and Bardohl, Roswitha and Ehrig, Hartmut and Ehrig, Karsten and Prange, Ulrike and Taentzer, Gabriele}, biburl = {https://www.bibsonomy.org/bibtex/23b3e62700d11a86f4ce2eaf25e41397b/leonardo}, booktitle = {Fundamental Aspects of Software Engineering}, citeulike-article-id = {1370086}, doi = {10.1016/j.tcs.2007.02.001}, interhash = {76c0ef3dede6bc4ecf0b373cca380cbd}, intrahash = {3b3e62700d11a86f4ce2eaf25e41397b}, journal = {Theoretical Computer Science}, keywords = {_hardcopy 2007 metamodelling statecharts _folder_2 graph_transformation}, month = May, number = 3, pages = {139--163}, posted-at = {2007-06-07 12:56:33}, priority = {3}, timestamp = {2009-02-11T20:52:36.000+0100}, title = {Attributed graph transformation with node type inheritance}, url = {http://dx.doi.org/10.1016/j.tcs.2007.02.001}, volume = 376, year = 2007 }