Compatibility between Syntax and Semantics of Graph Grammars

AbstractGraph grammars are a suitable formalism for the specification of systems. In particular, systems that involve a large amount of parallelism can be very well modeled as graph grammars. Relationships among graph grammars describe structural compatibilities at a syntactical level. These relationships can be used to model composition of graph grammars, as the parallel composition. The aim of this paper is to show that these syntactical relationships and constructions are compatible with semantical models of graph grammars. We will consider a sequential and a concurrent models for the semantics of graph grammars