An, action calculus which closely corresponds to the π-calculus is presented in graphical form, as so-called π -nets. First an elementary form of π-net, with no sequential control, is presented. Then, using a construction by Honda and Tokoro, it is shown informally that by adding a single control construction box to elementary π-nets, the sequential control present in the π-calculus can be recovered. (Another construction, rep, provides replication.) The graphical presentation suggests a few interesting variants of this control regime, which are studied briefly. The main purpose of the paper is to explore informally the power and utility of graphical forms of the π-calculus, in the context of action calculi. It also suggests that graphical forms of other action calculi should be explored.
CITATION STYLE
Milner, R. (1994). Pi-nets: A graphical form of π-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 788 LNCS, pp. 26–42). Springer Verlag. https://doi.org/10.1007/3-540-57880-3_2
Mendeley helps you to discover research relevant for your work.