Skip to main content

Concurrency:  2017-2018

Lecturer

Practical Coordinator

Degrees

Schedule S1(CS&P)Computer Science and Philosophy

Schedule B1 (CS&P)Computer Science and Philosophy

Schedule S1Computer Science

Schedule B1Computer Science

Schedule S1(M&CS)Mathematics and Computer Science

Schedule B1Mathematics and Computer Science

Schedule AMSc in Computer Science

MSc in Mathematics and Foundations of Computer Science

Term

Links

FDR: the CSP refinement checker

Overview

Computer networks, multiprocessors and parallel algorithms, though radically different, all provide examples of processes acting in parallel to achieve some goal. All benefit from the efficiency of concurrency yet require careful design to ensure that they function correctly. The concurrency course introduces the fundamental concepts of concurrency using the notation of Communicating Sequential Processes. By introducing communication, parallelism, deadlock, livelock, etc., it shows how CSP represents, and can be used to reason about, concurrent systems. Students are taught how to design communicating processes, how to construct realistic models of real systems, and how to write specifications that can be used to verify the correctness of the system models. One important feature of the module is its use of both algebraic laws and semantic models to reason about reactive and concurrent designs. Another is its use of FDR to animate models and verify that they meet their specifications.

Learning outcomes

At the end of the course the student should: 

  • understand some of the issues and difficulties involved in Concurrency;
  • be able to specify and model concuurent systems using CSP;
  • be able to reason about CSP models of systems using both algebraic laws and semantic models;
  • be able to analyse CSP models of systems using the model checker FDR.

Synopsis

  • Processes and observations of processes; point synchronisation, events, alphabets. Sequential processes: prefixing, choice, nondeterminism. Operational semantics; traces; algebraic laws. [3]
  • Recursion. Complete partial orders and fixed points as a means of explaining recursion; approximation, limits, least fixed points; guardedness and unique fixed points. [1]
  • Concurrency. Hiding. Renaming. [3]
  • Non-deterministic behaviours, refusals, failures;  the determinism ordering. [2]
  • Hiding and divergence, the failures-divergences model. [1]
  • Specification and correctness. [2]
  • Communication, pipes, buffers. Sequential composition. [2]
  • Case study. [2]

Syllabus

Deterministic processes: traces, operational semantics; prefixing, choice, concurrency and communication. Nondeterminism: failures and divergences; nondeterministic choice, hiding and interleaving. Further operators: pipes and (time permitting) sequential composition. Refinement, specification and proof. Process algebra: equational and inequational reasoning.

Reading list

Lecture Notes: The lecture notes for this year's course will be given out in lectures as the course progresses. They will only appear online on the Course Materials page with a significant delay.

Course Text:

Alternatives:

Overheads: This year's slides will appear on the Course Materials page over the course of the term.

Related research at the Department of Computer Science

Activities