15-312 Foundations of Programming Languages
Lecture 24: The Pi-Calculus
In this lecture we first discuss weak bisimulation for communicating,
concurrent processes and then introduce the pi-calculus. This adds the
capability of transmitting names during communication. Since names act
as channels, this means we can dynamically alter the communication
structure of the network. Milner refers to this capability as mobility.
We should with two examples how to exploit this mobility for
interesting concurrent process structures: a storage cell, and
a collection of processes to compute prime numbers following the
sieve of Eratosthenes.