Skip to main content

An action structure for synchronous π-calculus

  • Invited Lectures
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 710))

Included in the following conference series:

Abstract

After a review of relevant notions, an action structure is presented for the π-calculus. This yields a version of π-calculus which is synchronous in the sense of MEIJE or SCCS, i.e. an arbitrary amount of computation may take place in a single transition. The main new technical result is the construction of an incident set for the action structure, which guarantees a congruential strong bisimilarity for the calculus. The incident set is characterized using a new form of graphical representation for actions.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Girard, J.-Y., Linear logic, J. Theoretical Computer Science, Vol 50, pp1–102, 1987.

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. Milner, R., Action structures, Research Report LFCS-92-249, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1992.

    Google Scholar 

  8. Milner, R., The polyadic π-calculus: a tutorial, Research Report LFCS-91-180, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1991. (To appear in the Proceedings of the International Summer School on Logic and Algebra of Specification, Marktoberdorf, August 1991.)

    Google Scholar 

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

    Article  Google Scholar 

  10. Milner, R., Action structures for the π-calculus, Forthcoming research Report, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1993.

    Google Scholar 

  11. Milner, R., Parrow, J. and Walker D., A calculus of mobile processes, Parts I and II, Journal of Information and Computation, Vol 100, pp 1–40 and pp41–77, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Milner, R. (1993). An action structure for synchronous π-calculus. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics