A Proof of the Reducibility of General Port Graph Grammars to Simple Port Graph Grammars (2002)
BibTeX
@MISC{Stewart02aproof,
author = {Charles Stewart},
title = {A Proof of the Reducibility of General Port Graph Grammars to Simple Port Graph Grammars},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A uniform framework of port graph grammars, encompassing connection graphs, interaction nets and Lamping's partial sharing graphs, has been presented by the author in the article `Reducibility between classes of port graph grammar'. The aims of this report are to 1. Give a complete proof of reducibility between general PGGs and simple PGGs (only an outline of the proof was given in that article); 2. Give a short summary of the design of an implementation executing rewrite steps for simple port graph grammars, to justify the claim that port graph grammars are a reasonably efficient representation for code in a distributed environment; 3. Dicuss critically the fundamental notion of reducibility between rewrite systems provided in that article.
