A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Compatibility between Syntax and Semantics of Graph Grammars
1998
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
Graph grammars are a suitable formalism for the speci cation 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
doi:10.1016/s1571-0661(05)80236-1
fatcat:stk2eiuqibhwfgtzd3l3wbuksu