Advanced Lectures on Concurrent and Distribured Computation

Shoji YUEN Professor

Department: Graduate School of Information Science

Class Time: 2011 Fall Tuesday
Recommended for: Graduate School of Information Science
Department of Information Engineering
1st and 2nd year students (Master's Course)

close Course Overview

Key Features

In this course, I lectured on computation models with concurrency along with formal systems. I demonstrated the fundamental nature of concurrency in terms of process algebra on Milner's CCS (Calculus for Communicating Systems), regarded as one of the fundamental theories to ensure the correct behavior of concurrent programs with computational resources in high-speed inter-computer network. While conventional sequential programs execute instructions one by one, concurrent programs may change the behavior in response to other programs being run at the same time. Despite the potential efficiency of concurrent programs, they often unexpectedly result in errors. I explained a theory for designing concurrent programs aiming at error-free behavior. The theory deals with the concurrency as communicating processes utilizing the advantage of effective use of computational resources. To explore the correct behavior of communicating processes, I discussed the co-inductive characterization in contract to the inductive characterization for verification methods.

In the class, I avoided explaining complicated formulas so that students could grasp the general theory via abstract images. I also discussed how to deal with time passage used to enhance the reliability of concurrent programs. Finally, I mention the model checking technique becoming more popular as an the industry standard these days and demonstrated further theoretical approaches which improve the reliability of concurrent programs.

Close Section

close Syllabus

Course Aims

Students acquire the concepts and formalisms of concurrency. In particular, lectures on the semantics and syntax of communicating process calculi are given. Compared to the conventional sequential computation models, students will learn how to systematically solve problems caused by concurrency. The principles for constructing reliable concurrent software over computer network are discussed. The model checking technique is explored in formal methods to improve reliability.

Related Resources

  • Robin Milner: Communicating and mobile systems: the π-calculus (Cambridge University Press, 1999), ISBN 0-521-64320-1
  • Robin Milner: Communication and concurrency (Prentice Hall, 1989), ISBN 0-131-15007-3
  • Jan van Leeuwen: Handbook of Theoretical Computer Science (Volume B, Chapter 19) (The MIT Press, 1994), ISBN 9780262220392


Course Schedule

2Emulation relations and bisimulation relations
4Semantics of concurrency
5Semantics of concurrency
6Process algebra (strong equivalence)
7Process algebra
8Process algebra (weak equivalence)
9Process algebra
10Description examples and timed automatons
11Verification using timed automatons
12Verification using timed automatons
13Model checking
14Modal logic of time
15Summary / Final exam


Based on final exam and final report.

Close Section

close Class Materials

Lecture Handouts

Session #1
Introduction (PDF, 159KB)
Session #2
Emulation relations and bisimulation relations (PDF, 91KB)
Session #3
Equivalence (PDF, 78KB)
Session #4
Semantics of concurrency (PDF, 72KB)
Session #5
Semantics of concurrency (PDF, 53KB)
Session #6
Process algebra (strong equivalence) (PDF, 64KB)
Session #7
Process algebra (PDF, 60KB)
Session #8
Process algebra (weak equivalence) (PDF, 94KB)
Session #9
Process algebra (PDF, 46KB)
Session #10
Description examples and timed automatons (PDF, 80KB)
Session #11
Verification using timed automatons (PDF, 87KB)
Session #12
Verification using timed automatons (PDF, 73KB)
Session #13
Model checking (PDF, 162KB)
Session #14
Modal logic of time (PDF, 79KB)

Close Section

Page last updated February 26, 2014

The class contents were most recently updated on the date indicated. Please be aware that there may be some changes between the most recent year and the current page.

Browse by Category

  • Letters
  • History
  • Arts & Culture
  • Politics & Economics
  • Law
  • Philosophy
  • Education, Development & Psychology
  • International Studies
  • Informatics
  • Engineering & Technology
  • Physics
  • Chemistry
  • Mathematics
  • Life Sciences & Medicine
  • Environmental Studies & Earth Studies

Browse by School / Graduate School