Attributed graph transformation with node type inheritance


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. © 2007 Elsevier Ltd. All rights reserved.

Año de publicación:

2007

Keywords:

  • Graph transformation
  • Double pushout approach
  • Visual languages
  • Meta-Modelling

Fuente:

scopusscopus

Tipo de documento:

Article

Estado:

Acceso abierto

Áreas de conocimiento:

  • Ciencias de la computación
  • Ciencias de la computación

Áreas temáticas:

  • Métodos informáticos especiales