Models of Concurrent Computation

Models of Concurrent Computation

This course runs on in room 144 on Mondays at 2-3 and on Tuesdays at 9-11.

Course Material

CCS

  • Introduction to course
  • Introduction to CCS with accompanying lecture notes
  • Value-passing CCS
  • Modal Logic
  • The Concurrency Workbench
  • Strong Bisimulation
  • Weak Bisimulation

    The Pi calculus

    Nobuko Yoshida will be giving this half of the course.

    Exercises

    Exercises associated with CCS will be posted here. There will be an assessed exercise sheet on CCS, hand-out date 8th November, submission date 21th November at 4 o'clock.

    Recommended Books

    Communication and Concurrency, Robin Milner, Prentice Hall, 1989. This one is important.

    Modal and Temporal Properties of Processes, Colin Stirling, Springer, 2001.

    Communicating and Mobile Systems: the Pi calculus, Robin Milner, Cambridge University Press, 1999. Also worth reading.

    The Pi calculus: a Theory of Mobile Processes, Davide Sangiorgi and David Walker, Cambridge University Press, 2001. Only for enthusiasts!

    A Distributed Pi-Calculus, Matthew Hennessey, Cambridge University Press, 2007.

    The Edinburgh Concurrency Workbench

    The Workbench is a tool for describing, exploring and automatically verifying systems modelled in CCS. It is a good idea to use this tool as an aid towards understanding the course. Knowledge of the tool will not be formally assesssed in this course. Documentation

  • An introductory workout (postscript-file), written by Joachim Parrow. It takes you step by step through the basic features of the Workbench.
  • Examples of systems modelled as CCS processes.
  • A train crossing
    • Philippa Gardner, pg @ doc.ic.ac.uk