Calculi for Mobile Processes

http://move.to/mobility
(redirection service with advertising)

... the moose have retired ...

You may quickly observe, what's or on this page,
but a changelog of this page is also provided separately.

Discussion Forum

• Moca (Mobile calculi) - A moderated mailing list on models for mobility

Bibliographies

• The searchable bibliography, which is also available in two formats: bib and dvi.
• Silvano Dal-Zilio's commented bibilography on mobile processes
• Uwe Nestmann and Björn Victor's note in the EATCS Bulletin 64,
  mainly advertizing the online resources.
• Kohei Honda's selected bibliography on mobile processes,
  a useful personally commented reading guide to the area.

Books

• The Pi-Calculus - A Theory of Mobile Processes (by Davide Sangiorgi and David Walker), June 2001. To appear.
• Communicating and Mobile Systems: the -Calculus, (by Robin Milner). Cambridge University Press, May 1999.

Introductory Texts and Tutorials

• A Calculus for Mobile Processes (Parts I/II) (by Robin Milner, Joachim Parrow, and David Walker). Also available from this site: [Part I] [Part II] (Postscript)
• The Polyadic -Calculus: A Tutorial, (by Robin Milner). Also available from this site: [(Postscript)]
• An Introduction to the -calculus (by Joachim Parrow)
• Interaction Diagrams - An Easy Introduction to Mobile Processes in Pictures (by Joachim Parrow)
• A Brief Introduction to Applied Pi (by Peter Sewell)
• Asynchronous process calculi: the first-order and higher-order paradigms (Tutorial) (by Davide Sangiorgi).
• Interpreting functions as pi-calculus processes: a tutorial (by Davide Sangiorgi, no longer available online).
• Foundational Calculi for Programming Languages (by Benjamin Pierce). A chapter of a handbook for engineers, in which where the potential role of calculi for mobile processes as the core of high-level concurrent programming languages (in analogy to the role of lambda calculi as the core of functional programming languages) is explained.

[Please send me links to your favorite other introductory texts!]

A B C D E F G H I J K L M N O P Q R S T V W Y Z

Institutes

• Denmark, Sweden
  • BRICS: Basic Research in Computer Science, Denmark
  • Aalborg University, DoCS, Semantics & Theory of Computation: Ny-Klubben
  • Uppsala University, DoCSystems: Mobility Group
  • SICS Stockholm, The FDT group
• France, Italy
  • INRIA Rocqencourt: MOSCOVA (formerly PARA)
  • INRIA Sophia-Antipolis: MIMOSA (formerly Mobility Group)
  • University of Provence, Marseille, CMI, Modelisation & Verification
  • University of Bologna, Dept. of Computer Science
  • University of Pisa, DoCS, Process Description Languages
  • University of Firenze, Concurrency and Mobility Group
  • University of Genova, DISI
• Switzerland, Netherlands, Germany
  • EPF Lausanne, Programming Methods Lab
  • University of Berne, Software Composition Group
  • Centrum voor Wiskunde en Informatica (CWI)
  • Eindhoven University of Technology, Formal Methods Group
  • Leiden University, Theoretical Computer Science
  • Technical University München, Higher Order and Mobile Systems
  • University of Saarbrücken, DFKI, Programming Systems Lab
  • University of Karlsruhe, Institute for Program Structures and Data Organization
• Scotland, England
  • Microsoft Research at Cambridge: Programming Principles and Tools
  • University of Edinburgh, LFCS
  • University of Cambridge, Theory and Semantics of Programming Languages
  • University of Sussex at Brighton, COGS, Foundations of Computation (pub)
  • University of London, Department of Computing, Theory and Formal Methods
• United States, Japan
  • Carnegie-Mellon University (CMU), School of Computer Science
  • Massachusetts Institute of Technology (MIT), Programming Methodology Group
  • Kobayashi Lab
  • Yonezawa Lab (pub)
  • Tokoro Lab

(I still look for comments, pointers to online resources, etc)

• Action Calculi
• Behave @ Microsoft
• BioSPI (based on Stochastic Pi)
• Buisness Process Modeling Initiative
• Mobile Ambients - Cardelli's Ambit
• Blue
• Distributed Pi
• Functional Nets
• Join Calculus
• Seal Calculus
• Spi Calculus
• TyCO: Typed Concurrent Objects

• Abstract Interpreter
• The AmbIcobjs Demo
• CRYPTYC: Cryptographic Protocol Type Checker
• Facile
• Funnel
• JACK Tool Set
• Join Calculus
• Klaim
• Mobility Workbench
• Mozart Oz
• OBC Workbench
• Piccola
• Pict
• Nomadic Pict (Resources)
• STA (Symbolic Trace Analyzer)
• The TyCO Implementation Home-Page
• VPAM-0.8

• Projects
  • PROFUNDIS
  • CONFER-2
  • CONFER: [ pub ] [ Report1 ] [ Report2 ]
  • LOMAPS
  • COORDINA
• Teaching
  • A pi-course introducing the -calculus, given at SICS.
• Mobile Agents
  • Mobile Code
  • Agent Pages
  • Mobile Computing
  • More pointers from the Project Mole
• Mailing lists
  • Concurrency
  • Types
• Formal methods for concurrent systems

Last modified: Fri Nov 24 18:06:19 CET 2006 Uwe Nestmann <Uwe.Nestmann@epfl.ch>