Concurrency, Pi, and Semantics for Distributed Systems
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. It will be
somewhat extended from the talks I gave last year.
Slides and tutorial in http://www.cl.cam.ac.uk/users/pes20/Minicourse/index.html.