BRICS · Contents · Lecturer · Programme · References

Process Calculi: Communication, Mobility, and Constraints

A BRICS Mini-Course
April 27-29, 2004

Lectures by
Frank D. Valencia, frankv@it.uu.se
Dept. of Information Technology, Computer Systems, Uppsala University, Sweden

Course Contents

The minicourse is brief introduction to some representative process calculi in concurrency. We shall discusss Process calculi for Communicating Systems (CCS), for Mobility (Pi Calculus) and for shared-memory (CCP: Concurrent Constraint Programming).

The mini-course does not presuppose knowledge in Concurrency Theory.

About the Lecturer

Frank D. Valencia got his PhD from BRICS, Univ. of Aarhus, in 2003. Currently he is a postdoc at Uppsala University. His research is within Concurrency Theory; in particular Process Calculi, Concurrent Constraint Programming and Temporal Logics.

Programme

Tuesday April 27, 2004, 15:15-17:00 in Turing-016

CCS: Communicating Systems

  • Introduction: Motivation and Typical Issues Addressed in Process Calculi.
  • From Automata Theory to CCS.
  • Process Equivalences
  • Temporal Logics.

Wednesday April 28, 2004, 15:15-17:00 in Turing-016

The Pi Calculus: Mobile Systems.

  • Introduction: From CCS to the Pi Calculus.
  • Reduction Semantics.
  • Equivalences for Pi.

Thursday April 29, 2004, 15:15-17:00 in Turing-016

CCP (Concurrent Constraint Programming): Reactive Systems.

  • Introduction: CCP, Timed CCP
  • A CCP Calculus: Ntcc
  • Semantics, Logic, and Applications.

References

  1. Communicating and Mobile Systems: the pi-Calculus, Robin Milner. Cambridge University Press, May 1999.
  2. Lectures Notes on Timed CCP. To appear in LNCS volume from the 4th Advanced Course on Petri Nets ICPN'03.