Abstract
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.
This work was done with the support of a Senior Fellowship from the Science and Engineering Research Council, UK.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abadi, M., Cardelli, L., Curien, P-L. and Lévy, J-J., Explicit substitutions, Journal of Functional Programming 1, 4 (October 1991), 375–416.
Berry, G. and Boudol, G., The chemical abstract machine, Journal of Theoretical Computer Science, Vol 96, pp217–248, 1992.
Honda, K. and Tokoro, M., An object calculus for asynchronous communication, Proc. European Conference on object-oriented programming, Lecture Notes in Computer Science, Vol 512, Springer, pp133–147, 1991.
Milner, R., Action structures, Research Report LFCS-92-249, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1992.
Milner, R., The polyadic π-calculus: a tutorial, in Logic and Algebra of Specification, ed. F.L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993, pp203–246.
Milner, R., Action structures for the π-calculus, Research Report ECS-LFCS-93-264, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1992.
Milner, R., Action calculi I: axioms and applications, Computer Science Department, Edinburgh University, 1993. Also appeared as Action calculi, or syntactic action structures, Proceedings of MFCS '93, Lecture Notes in Computer Science, Springer, 1993.
Milner, R., Parrow, J. and Walker D., A calculus of mobile processes, Parts I and II, Journal of Information and Computation, Vol 100, pp1–40 and pp41–77, 1992.
Parrow, J., Interaction diagrams, SICS Research Report R93:06, 1993. To appear in proceedings of REX'93 Workshop, Lecture Notes in Computer Science, Springer Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milner, R. (1994). Pi-nets: A graphical form of π-calculus. In: Sannella, D. (eds) Programming Languages and Systems — ESOP '94. ESOP 1994. Lecture Notes in Computer Science, vol 788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57880-3_2
Download citation
DOI: https://doi.org/10.1007/3-540-57880-3_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57880-2
Online ISBN: 978-3-540-48376-2
eBook Packages: Springer Book Archive