The update calculus

Extended abstract
  • Joachim Parrow
  • Björn Victor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1349)


In the update calculus concurrent processes can perform update actions with side effects, and a scoping operator can be used to control the extent of the update. In this way it incorporates fundamental concepts both from imperative languages or concurrent constraints formalisms, and from functional formalisms such as the λ- and π-calculi. Structurally it is similar to but simpler than the π-calculus; it has only one binding operator and a symmetry between input and output. We define the structured operational semantics and the proper bisimulation equivalence and congruence, and give a complete axiomatization. The π-calculus turns out to be an asymmetric subcalculus.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bar84]
    H. P. Barendregt. The Lambda Calculus. Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1984.Google Scholar
  2. [BKS88]
    R. J. R. Back and R. Kurki-Suonio. Distributed cooperation with action systems. ACM Transactions on Programming Languages and Systems, 10(4):513–554, Oct. 1988.Google Scholar
  3. [CM88]
    K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.Google Scholar
  4. [Dam93]
    M. Dam. Model checking mobile processes. In E. Best, editor, CONCUR'93: Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 22–36. Springer-Verlag, 1993.Google Scholar
  5. [Fu97]
    Y. Fu. A proof theoretical approach to communication. In P. Degano and R. Gorrieri, editors, ICALP'97: Automata, Languages and Programming, volume 1256 of Lecture Notes in Computer Science, pages 325–335. Springer-Verlag, 1997.Google Scholar
  6. [Mil91]
    R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, Oct. 1991.Google Scholar
  7. [MP91]
    Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.Google Scholar
  8. [MPW92]
    R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1–77, Sept. 1992.Google Scholar
  9. [PS95]
    J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Journal of Information and Computation, 120(2):174–197, 1995.Google Scholar
  10. [PS96]
    M. Pistore and D. Sangiorgi. A partition refinement algorithm for the π-calcuius. In R. Alur and T. A. Henzinger, editors, Proceedings of CAV'96, volume 1102 of Lecture Notes in Computer Science. Springer-Verlag, 1996.Google Scholar
  11. [PV97]
    J. Parrow and B. Victor. The update calculus (full version). Technical Report DoCS 97/93, Department of Computer Systems, Uppsala University, Sweden, Sept. 1997.Google Scholar
  12. [San92]
    D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, UK, 1992.Google Scholar
  13. [San95a]
    D. Sangiorgi. On the proof method for bisimulation (extended abstract). In J. Wiederman and P. Hájek, editors, Mathematical Foundations of Computer Science 1995 (MFCS'95), volume 969 of Lecture Notes in Computer Science, pages 479–488. Springer-Verlag, 1995.Google Scholar
  14. [San95b]
    D. Sangiorgi. π-calculus, internal mobility and agent-passing calculi. Rapport de Recherche RR-2539, INRIA Sophia-Antipolis, 1995.Google Scholar
  15. [San96]
    D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33:69–97, 1996.Google Scholar
  16. [Smo94]
    G. Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, Proc. 1st International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 50–72. Springer-Verlag, Sept. 1994.Google Scholar
  17. [VM94]
    B. Victor and F. Moller. The Mobility Workbench — a tool for the π-calculus. In D. Dill, editor, CAV'94: Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 428–440. Springer-Verlag, 1994.Google Scholar
  18. [VP96]
    B. Victor and J. Parrow. Constraints as processes. In U. Montanari and V. Sassone, editors, CONCUR'96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 389–405. Springer-Verlag, 1996.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Joachim Parrow
    • 1
  • Björn Victor
    • 2
  1. 1.Dept. of TeleinformaticsRoyal Institute of TechnologyKistaSweden
  2. 2.Dept. of Computer SystemsUppsala UniversityUppsalaSweden

Personalised recommendations