Teaching

Course and Book

• CONCURRENCY:CONCEPTS, MODELS AND PROGRAMS – CO223

  • This course aims to introduce students to the use of abstract models for exploring and analysing concurrent systems. The models used are appropriate for explaining concurrency concepts and for exploring and analysing possible solutions which satisfy safety and progress properties. Concurrent programming is introduced as the means for implementing the model solutions using program primitives provided in Java.

• Concurrency: State Models and Java Programs (Wiley 2006, 2nd Edition)

  • The material includes slides, Java applets and the LTSA analysis tool.  (revised 2015)

  • Japanese version of the slides – courtesy of Prof Tetsuo Tamai. (Slides)

  • Spanish version of the slides – courtesy of Prof Sebastian Uchitel. (Chapters: 1 2 3 4 5 6 7 12 Bisimulation )

Course

• Distributed Algorithms

• Notes 2005:

  • Asynchronous Algorithms

  • Asynchronous Resource Algorithms

  • Demos: a zip file containing models for several asynchronous algorithms

  • Logical time