scientific article; zbMATH DE number 4049096

From MaRDI portal
Publication:3785985





[For the entire collection see Zbl 0636.00013.] The standard algebraic theory of graph grammars is based on the notion of ``color-preserving graph morphisms and on a ``double pushout construction to represent gluing of graphs. In this paper, we impose a simple structure on the sets of colors to allow variables in both graphs and productions. Instantiations are performed by graph morphisms. Using relative unification, we define the composition of rules and prove the concurrency theorem in this more general framework. By restricting our attention to rooted directed acyclic graphs, we can represent standard term rewriting with first order substitutions. One of the motivations for this study is the attempt to provide a description of the static behavior of rule-based expert systems.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785985)