A graph rewriting semantics for the polyadic pi-calculus
Reference
Barbara König. A graph rewriting semantics for the polyadic pi-calculus. In Proc. of GT-VMT '00 (Workshop on Graph Transformation and Visual Modeling Techniques), pages 451–458. Carleton Scientific, 2000.
Abstract
We give a hypergraph rewriting semantics for the polyadic pi-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the pi-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into pi-calculus can be shown by using an intermediate notation, so-called name-based graph terms.
Suggested BibTeX entry:
@inproceedings{Koe00d,
author = {Barbara K{\"o}nig},
booktitle = {Proc. of GT-VMT '00 (Workshop on Graph Transformation and Visual Modeling Techniques)},
pages = {451--458},
publisher = {Carleton Scientific},
title = {A graph rewriting semantics for the polyadic pi-calculus},
year = {2000}
}
