A graph rewriting semantics for the polyadic pi-calculus
In: Proceedings of the Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2000)
Carleton Scientific (2000), S. 451-458
Buchaufsatz / Kapitel / Fach: Informatik
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.
Dieser Eintrag ist freigegeben.