Concurrency, Pi, and Semantics for Distributed Systems
(a PhD minicourse, October 2001)
This course will outline semantic techniques for dealing with
distributed systems. In the first part I will give a rapid overview
of work on concurrency - process calculi, labelled-transition and
reduction semantics, equivalences, and pi-calculus-style name passing.
The second part will turn to distribution, highlighting some of the
main design choices taken in various calculi that address problems of
mobility, security, and partial failure.
This is by way of a snapshot of how the material fits together, and a
collection of extended pointers into the literature.
Here are:
- The slides [ps.gz]; and
-
Applied Pi - A Brief Tutorial. Technical
Report 498, Computer Laboratory, University of Cambridge 2000.
This tutorial goes into more detail, with a model development of some
of the pi-calculus theory and more discussion of distributed calculi.
Also in pdf.
Peter.Sewell@cl.cam.ac.uk
[Validate this page.]