Computer Laboratory
Communicating automata: Where classical automata theory falls short; Add non-determinism and interaction; Structural congruence and labelled transition systems; Bisimilarity, strong and weak; Examples: a lottery, a jobshop.
Pi calculus: Movement by communicating names, scope extrusion; Examples: mobile phones, disciplined resource use; Transitions and bisimilarity extended; Data structures as processes; Pi calculus as a basic model of computation.