Jump to content

Attributed graph grammar

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cabayi (talk | contribs) at 14:38, 24 September 2016 (Implementation: rm see). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes. In the algebraic approach to graph grammars, they are usually formulated using the double-pushout approach or the single-pushout approach.

Implementation

AGG, a rule-based visual language that directly expresses attributed graph grammars using the double-pushout approach has been developed at TU Berlin for many years.[1]

References

  • Rozenberg, Grzegorz (1997), Handbook of Graph Grammars and Computing by Graph Transformations, World Scientific Publishing, volumes 1–3, ISBN 9810228848.
  • Ehrig, Heckel, Korff, Lowe, Ribeiro, Wagner and Corradini, 1997. Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. Pp. 247-312 of (Rozenberg, 1997).