Hartmut Ehrig

Learn More
  • Hartmut Ehrig
  • Graph-Grammars and Their Application to Computer…
  • 1978
The aim of this survey is to motivate and introduce the basic constructions and results which have been developed in the algebraic theory of graph grammars up to now. The complete material is illustrated by several examples, especially by applications to a "very small data base system", where consistent states are represented as qraphs, operation rules and(More)
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The(More)