Skip to main content

Action Structures and the Pi Calculus

  • Conference paper
Proof and Computation

Part of the book series: NATO ASI Series ((NATO ASI F,volume 139))

Abstract

Action structures are proposed as a variety of algebra to underlie concrete models of concurrency and interaction. An action structure is equipped with composition and product of actions, together with an indexed family of abstractors to allow parametrisation of actions, and a reaction relation to represent activity. The eight axioms of an action structure make it an enriched strict monoidal category.

In Part I the notion of action structure is developed mathematically, and examples are studied ranging from the evaluation of expressions to the static s and dynamics of Petri nets. For algebraic process calculi in particular, it is shown how they may be defined by a uniform superposition of process structure upon an action structure specific to each calculus.

The theory of action structures emphasizes the notion of effect; that is, the effect which any interaction among processes exerts upon its participants. Effects together with incidents (roughly speaking, observable actions) allow a uniform treatment of bisimulation congruence.

In Part II, the π-calculus is treated as an extended example of this uniform process theory. Three action structures for the π-calculus are examined; they are presented in a simple graphical form. The incidents for π-calculus are best characterized in terms of reachability, a graphical notion. This leads to a bisimulation congruence for the synchronous π-calculus, in which individual transitions may involve actions of arbitrary complexity.

This work was done with the support of a Senior Fellowship from the Science and Engineering Research Council, UK.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L. and Hennessy, M.C., Towards action-refinement in process algebras, to appear in Journal of Information and Computation.

    Google Scholar 

  2. Austry, D. and Boudol, G., Algèbre de processus et synchronisation, Journal of Theor. Comp. Science, Vol 30, pp 90–131, 1984.

    MathSciNet  Google Scholar 

  3. Baeten, J.C.M. and Weijland, W.P., Process Algebra, Cambridge University Press 1990.

    Google Scholar 

  4. Barr, M. and Wells, C., Toposes, Triples and Theories, Springer Verlag, 1985.

    MATH  Google Scholar 

  5. Bellin, G. and Scott, P.J. (with introduction by S. Abramsky), On the π-calculus and linear logic, to appear in Theoretical Computer Science, (Proc. MFPS Conference, Oxford 91, ed. M. Mislove and A.W. Roscoe ), 1993.

    Google Scholar 

  6. Berry, G. and Boudol, G., The chemical abstract machine, Journal of Theoretical Computer Science, Vol 96, pp 217–248, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. Best, E., Devillers, R. and Hall, J.G., The box calculus: a new causal algebra with multi- label communication, in Advances in Petri Nets ’92, ed. G.Rozenberg, Lecture Notes in Computer Science, Springer Verlag, Vol.609, pp 21–69, 1992.

    Google Scholar 

  8. Brookes, S.D., Hoare, C.A.R. and Roscoe, A.W., A theory of communicating sequential processes, Journal of ACM, Vol 31, pp 560–599, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  9. Cherkasova, L.A. and Kotov, V.E., Descriptive and analytical process algebras, in Ad-vances in Petri Nets ’89, ed. G Rozenberg, Lecture Notes in Computer Science, Springer Verlag, Vol 424, pp 77–104, 1989.

    Google Scholar 

  10. Freyd, P.J. and Kelly, G.M., Categories of continuous functors, I, Journal of Pure and Applied Algebra, Vol 2, pp l69–191, 1972.

    Article  MathSciNet  Google Scholar 

  11. Girard, J.-Y., Linearlogic, J. Theoretical Computer Science, Vol 50, pp1–102, 1987.

    Google Scholar 

  12. van Glabbeek, R. and Goltz, U., Equivalence notions for concurrent systems and refinement of actions, Proc. 4th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Springer Verlag, Vol 379, pp 237–248, 1988.

    Google Scholar 

  13. Gunter, C.A. and Scott, D.S., Semantic domains, in Handbook of Theoretical Computer Science, Vol A, pp633–674, Elsevier, 1990.

    Google Scholar 

  14. Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, 1985.

    Google Scholar 

  15. Lafont, Y., Interaction nets, Proc. 17th ACM Symposium on Principles of Programming Languages, 1990.

    Google Scholar 

  16. Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Journal of Theoretical Computer Science, Vol 96, pp 73–155, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. Meseguer, J. and Montanari, U., Petri nets are monoids, Journal of Information and Computation, Vol 88, pp l05–155, 1990.

    Article  MathSciNet  Google Scholar 

  18. Milner, R., Calculi for synchrony and asynchrony, Journal of Theoretical Computer Science Vol 25, pp 267–310, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  19. Milner, R., Communication and Concurrency, Prentice Hall, 1989.

    Google Scholar 

  20. Milner, R., The polyadic 7r-calculus: a tutorial, in Logic and Algebra of Specification, ed. F.L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993.

    Google Scholar 

  21. Milner, R., Action calculi, or concrete action structures, Proc. MFCS Conference, Gdansk, Poland, Lecture Notes in Computer Science, Springer Verlag, Vol 711, ppl05–121,1993. (Also titled Action calculi I: axioms and applications, the first of a series on action calculi.)

    Google Scholar 

  22. Milner, R., Action calculi II: π-nets with boxes and replication, Internal report, Laboratory for Foundations of Computer Science, Dept. of Computer Science, University of Edinburgh, 1993.

    Google Scholar 

  23. Milner, R., Action calculi III: higher-order, submitted for publication. Internal report, Laboratory for Foundations of Computer Science, Dept. of Computer Science, University of Edinburgh, 1993.

    Google Scholar 

  24. Milner, R., Parrow, J. and Walker D., A calculus of mobile processes, I and II, Journal of Information and Computation, Vol 100, ppl–40 and pp 41–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  25. Nielsen, M., Plotkin, G.D. and Winskel, G., Petri nets, event structures and domains, Journal of Theoretical Computer Science, Vol 13, No 1, 1981.

    Article  MathSciNet  Google Scholar 

  26. Nielsen, M., and Winskel, G., Models for concurrency, to appear in Volume IV of the Handbook of Logic and the Foundations of Computer Science, ed. D.Gabbay, Oxford University Press, 1993.

    Google Scholar 

  27. Reisig, W., Petri Nets, EATCS Monographs on Theoretical Computer Science, ed. W.Brauer, G.Rozenberg, A Salomaa, Springer Verlag, 1983.

    Google Scholar 

  28. Winskel, G., Petri nets, algebras, morphisms and compositionality, Journal of Information and Computation, March 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Milner, R. (1995). Action Structures and the Pi Calculus. In: Schwichtenberg, H. (eds) Proof and Computation. NATO ASI Series, vol 139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79361-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-79361-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-79363-9

  • Online ISBN: 978-3-642-79361-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics