Abstract

In this paper we propose a translation into high level Petri nets of the terms of a finite fragment of the p-calculus. Our construction renders in a compositional way the control flow aspects present in p-calculus process expressions, by adapting the existing graph-theoretic net composition operators. Those aspects which are related to term rewriting, as well as name binding, are handled through special inscriptions of places, transitions and arcs, together with a suitable choice of the initial marking.

Keywords

p-calculus, Petri nets, model translation