C. Di Giusto, MCF

Communication and Concurrency

L’objectif du cours est d'introduire des formalismes mathématiques pour modéliser et raisonner sur les propriétés de systèmes parallèles.

Description

The aim of this course is to introduce mathematical formalisms for modelling and reasoning about properties of parallel, reactive systems. The list of precise topics covered by the cours changes every year. Topics may include models of message passing and shared memory concurrency (Petri nets, process algebras, communicating and timed automata) as well as formalisms to reason on such systems (bisimulation techniques, session types, logics, invariants…).

Topics (non exhaustive list):

  • Labelled transition systems
  • CCS, pi-calculus
  • Communicating and Timed automata
  • Bisimulation and Session types
  • Petri nets and invariants

Presentation of the cours (slides)

Calendrier

Cours

Modalités de contrôle des connaissances

Final exam: 75% Project or report: 25%

Ressources

R. Milner, Communication and conurrency, Prentice-Hall, 1989 Davide Sangiorgi, David Walker, The Pi-Calculus: A Theory of Mobile Processes, Cambridge University Press, 2003 J.A. Bergstra, A. Ponse, S.A. Smolka, Handbook of Process Algebra, Elsevier, 2001