Advertisement

Explicit Fusions

  • Philippa Gardner
  • Lucian Wischik
Conference paper
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Output Process Reaction Relation Parallel Composition Process Framework Fusion Transition 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Y. Fu. Open bisimulations on chi processes. In CONCUR, LNCS 1664. Springer, 1999.Google Scholar
  2. 2.
    P. Gardner. From process calculi to process frameworks. In CONCUR, 2000. To appear.Google Scholar
  3. 3.
    P. Gardner and L. Wischik. Symmetric action calculi (abstract). Manuscript online.Google Scholar
  4. 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. 5.
    K. Honda. Elementary structures in process theory (1): sets with renaming. Mathematical Structures in Computer Science. To appear.Google Scholar
  6. 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. 7.
    M. Merro. Onequators in asynchronous name-passing calculi without matching. InEXPRESS, volume 27. Elsevier Science Publishers, 1999.Google Scholar
  8. 8.
    R. Milner. Communicating and mobile systems: the pi calculus. CUP, 1999.Google Scholar
  9. 9.
    Robin Milner. Calculi for interaction. Acta Informatica, 33(8), 1996.Google Scholar
  10. 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. 11.
    D. Sangiorgi. Pi-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2), 1996.Google Scholar
  12. 12.
    D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33, 1996.Google Scholar
  13. 13.
    B. Victor and J. Parrow. Concurrent constraints in the fusion calculus. In ICALP, LNCS 1443. Springer, 1998.Google Scholar
  14. 14.
    L. Wischik. 2001. Ph.D. thesis. In preparation.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Philippa Gardner
    • 1
  • Lucian Wischik
    • 1
  1. 1.Computing LaboratoryUniversity of CambridgeUK

Personalised recommendations