Skip to main content

Explicit Fusions

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2000 (MFCS 2000)

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

Abstract

We introduce explicit fusions of names. To ‘fuse’ two names is to declare that they may be used interchangeably. An explicit fusion is one that can exist in parallel with some other process, allowing us to ask for instance how a process might behave in a context where x = y.We present the πF -calculus, a simple process calculus with explicit fusions. It is similar in many respects to the fusion calculus but has a simple local reaction relation. We give embeddings of the π-calculus and the fusion calculus.We provide a bisimulation congruence for the πF-calculus and compare it with hyper-equivalence in the fusion calculus.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Y. Fu. Open bisimulations on chi processes. In CONCUR, LNCS 1664. Springer, 1999.

    Google Scholar 

  2. P. Gardner. From process calculi to process frameworks. In CONCUR, 2000. To appear.

    Google Scholar 

  3. P. Gardner and L. Wischik. Symmetric action calculi (abstract). Manuscript online.

    Google Scholar 

  4. P. Gardner and L. Wischik. A process framework based on the πF calculus. In EXPRESS, volume 27. Elsevier Science Publishers, 1999.

    Google Scholar 

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

    Google Scholar 

  6. K. Honda and N. Yoshida. On reduction-based process semantics. In Foundations of Software Technology and Theoretical Computer Science, LNCS 761. Springer, 1993.

    Google Scholar 

  7. M. Merro. Onequators in asynchronous name-passing calculi without matching. InEXPRESS, volume 27. Elsevier Science Publishers, 1999.

    Google Scholar 

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

    Google Scholar 

  9. Robin Milner. Calculi for interaction. Acta Informatica, 33(8), 1996.

    Google Scholar 

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

    Google Scholar 

  11. D. Sangiorgi. Pi-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2), 1996.

    Google Scholar 

  12. D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33, 1996.

    Google Scholar 

  13. B. Victor and J. Parrow. Concurrent constraints in the fusion calculus. In ICALP, LNCS 1443. Springer, 1998.

    Google Scholar 

  14. L. Wischik. 2001. Ph.D. thesis. In preparation.

    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., Wischik, L. (2000). Explicit Fusions. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics