Advertisement

A labelled transition system for πε-calculus

  • Franck van Breugel
II CAAP CAAP-4: Bisimulations and Pi-calculus
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1214)

Abstract

A labelled transition system is presented for Milner's πε-calculus. This system is related to the reduction system for the calculus presented by Bellin and Scott. Also a reduction system and a labelled transition system for πεI-calculus are given and their correspondence is studied. This calculus is a subcalculus of πε-calculus in the way Sangiorgi's πI-calculus is a subcalculus of ordinary π-calculus.

Keywords

Transition Relation Reduction System Label Transition System Side Condition Internal Mobility 
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.

References

  1. [Abr94]
    S. Abramsky. Proofs as Processes. Theoretical Computer Science, 135(1):5–9, December 1994.CrossRefGoogle Scholar
  2. [ACS96]
    R.M. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulation for the Asynchronous π-Calculus. In U. Montanari and V. Sassone, editors, Proceedings of CONCUR'96, volume 1119 of Lecture Notes in Computer Science, pages 147–162, Pisa, August 1996. Springer-Verlag.Google Scholar
  3. [Bou92]
    G. Boudol. Asynchrony and the π-Calculus (note). Report RR-1702, INRIA, Sophia Antipolis, May 1992.Google Scholar
  4. [Bre97]
    F. van Breugel. A Labelled Transition System for πε-Calculus. Report, University of Pisa, Pisa, 1997.Google Scholar
  5. [BS94]
    G. Bellin and P. Scott. On the π-Calculus and Linear Logic. Theoretical Computer Science, 135(1):11–65, December 1994.CrossRefGoogle Scholar
  6. [Eng96]
    J. Engelfriet. A Multiset Semantics for the π-Calculus. Theoretical Computer Science, 153(1/2):65–94, January 1996.CrossRefGoogle Scholar
  7. [Fer96]
    G. Ferrari. On Reduction Semantics for Timed Calculi. Draft, October 1996.Google Scholar
  8. [FMS96]
    M. Fiore, E. Moggi, and D. Sangiorgi. A Fully Abstract Model for the π-Calculus. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pages 43–54, New Brunswick, July 1996. IEEE Computer Society Press.Google Scholar
  9. [Hen96]
    M. Hennessy. A Fully Abstract Denotational Semantics for the π-Calculus. Report 96:04, University of Sussex, Brighton, June 1996.Google Scholar
  10. [HT91]
    K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In P. America, editor, Proceedings of the European Conference on Object-Oriented Programming, volume 512 of Lecture Notes in Computer Science, pages 133–147, Geneva, July 1991. Springer-Verlag.Google Scholar
  11. [HY93]
    K. Honda and N. Yoshida. On Reduction-Based Process Semantics. In R.K. Shyamasundar, editor, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 761 of Lecture Notes in Computer Science, pages 371–387, Bombay, December 1993. Springer-Verlag.Google Scholar
  12. [Mil91]
    R. Milner. The Polyadic π-Calculus: a tutorial. Report ECS-LFCS-91-180, University of Edinburgh, Edinburgh, October 1991.Google Scholar
  13. [Mil92]
    R. Milner. Functions as Processes. Mathematical Structures in Computer Science, 2(2):119–141, June 1992.Google Scholar
  14. [Mil93]
    R. Milner. Action Structures for the π-Calculus. Report ECS-LFCS-93-264, University of Edinburgh, Edinburgh, May 1993.Google Scholar
  15. [MP95]
    U. Montanari and M. Pistore. Concurrent Semantics for the π-Calculus. In S. Brookes, M. Main, A. Melton, and M. Mislove, editors, Proceedings of the 11th Annual Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Theoretical Computer Science, New Orleans, March/April 1995. Elsevier Science.Google Scholar
  16. [MPW91]
    R. Milner, J. Parrow, and D. Walker. Modal Logics for Mobile Processes. In J.C.M. Baeten and J.F. Groote, editors, Proceedings of CONCUR'91, volume 527 of Lecture Notes in Computer Science, pages 45–60, Amsterdam, August 1991. Springer-Verlag.Google Scholar
  17. [MPW92]
    R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, I and II. Information and Computation, 100(1):1–40 and 41–77, September 1992.CrossRefGoogle Scholar
  18. [Plo81]
    G.D. Plotkin. A Structural Approach to Operational Semantics. Report DAIMI FN-19, Aarhus University, Aarhus, September 1981.Google Scholar
  19. [San92]
    D. Sangiorgi. Expressing Mobility in Process Algebras: first-order and higher-order paradigms. PhD thesis, University of Edinburgh, Edinburgh, 1992.Google Scholar
  20. [San96]
    D. Sangiorgi. π-Calculus, Internal Mobility, and Agent-Passing Calculi. Theoretical Computer Science, 167(1/2):235–274, October 1996.CrossRefGoogle Scholar
  21. [Sta96]
    I. Stark. A Fully Abstract Domain Model for the π-Calculus. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pages 36–42, New Brunswick, July 1996. IEEE Computer Society Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Franck van Breugel
    • 1
  1. 1.Department of Computer ScienceUniversità di PisaPisaItaly

Personalised recommendations