Skip to main content

From Process Calculi to Process Frameworks

  • Conference paper
  • First Online:
Book cover CONCUR 2000 — Concurrency Theory (CONCUR 2000)

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

Included in the following conference series:

Abstract

We present two process frameworks: the action calculi of Milner, and the fusion systems of Gardner and Wischik. The action calculus framework is based on process constructs arising from the π-calculus. We give a non-standard presentation of the π-calculus, to emphasise the similarities between the calculus and the framework. The fusion system framework generalises a new process calculus called the πF -calculus. We describe the πF-calculus, which is based on different process constructs to those of the π-calculus, and show that the generalisation from the calculus to the framework is simple. We compare the frameworks by studying examples.

The author acknowledges support of an EPSRC Advanced Fellowship.

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. Y. Fu. A proof-theoretical approach to communication. ICALP, LNCS 1256, Springer-Verlag, 1997.

    Google Scholar 

  2. P. A. Gardner and L. Wischik. A process framework based on the πF-calculus. EXPRESS, Elsevier Science Publishers, 1999.

    Google Scholar 

  3. P. A. Gardner and L. Wischik. Explicit fusions. MFCS, 2000. To appear.

    Google Scholar 

  4. M. Hasegawa. Models of Sharing Graphs (A Categorical Semantics of Let and Letrec). PhD thesis, ECS-LFCS-97-360, University of Edinburgh, 1997.

    Google Scholar 

  5. M. Hasegawa and P. Gardner. Higher order action calculi and the computational λ-calculus. Theoretical Aspects of Computer Software, Sendai, 1997.

    Google Scholar 

  6. K. Honda. Elementary structures in process theory (1): sets with renaming. Mathematical Structures in Computer Science, 2000. To appear.

    Google Scholar 

  7. A. Joyal, R. Street, and D. Verity. Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society, 119(3), 1996.

    Google Scholar 

  8. Jamey Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. CONCUR, 2000. To appear.

    Google Scholar 

  9. R. Milner. Higher order action calculi. Computer Science Logic, LNCS 832, Springer-Verlag, 1994.

    Chapter  Google Scholar 

  10. R. Milner. Reflexive action calculi. Unpublished manuscript, 1994.

    Google Scholar 

  11. R. Milner. Calculi for interaction. Acta Informatica, 33(8):707–737, 1996.

    Article  MathSciNet  Google Scholar 

  12. R. Milner. Communicating and mobile systems: the pi calculus. CUP, 1999.

    Google Scholar 

  13. J. Parrow and B. Victor. The fusion calculus: expressiveness and symmetry in mobile processes. LICS, Computer Society Press, 1998.

    Google Scholar 

  14. D. Sangiorgi. A theory of bisimulation for the pi-calculus. CONCUR, Springer-Verlag, 1993.

    Google Scholar 

  15. Peter Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 2000. To appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gardner, P. (2000). From Process Calculi to Process Frameworks. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44618-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67897-7

  • Online ISBN: 978-3-540-44618-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics