Parallel Rewriting of Graphs through the Pullback Approach
Michel Bauderon · Electronic Notes in Theoretical Computer Science · 1995
We continue here the development of our description of the pullback approach to graph rewriting - already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine definition of parallel rewriting (parallel application of several rewriting rules at several different places in the graph is actually expressed through the application of one single mathematical operation) and even further that a deterministic graph grammar can be described by a single rule which we call P-grammar.