This lecture presents methods and tools for the correct design of systems consisting of agents (or processes) running asynchronously in parallel, possibly subject to real-time constraints. These methods and tools respond to the needs of telecoms (telecommunication protocols), software (distributed algorithms, cloud computing, ...), embedded systems, and hardware (multiprocessor architectures, arbitration protocols, cache coherency protocols, asynchronous circuits, GALS architectures, ...). The methods rely on a formal description of the system in an appropriate language, which can be automatically validated by tools implementing verification techniques, such as model checking or equivalence checking.

Basic concepts of asynchronous concurrency and real-time
Formal models: communicating automata, timed automata, process algebras
Formal verification techniques (model checking, equivalence checking)
Temporal logic

Some knowledge of programming languages.

H. Garavel. Défense et illustration des algèbres de processus. In Zoubir Mammeri (Ed), Actes de l'Ecole d'été Temps Réel ETR 2003 (Toulouse, France), Institut de Recherche en Informatique de Toulouse, septembre 2003.
http://www.inrialpes.fr/vasy/Publications/Garavel-03.html

S. Merz and N. Navet (Eds). Modeling and Verification of Real-Time Systems. Wiley, 2008.

Written examination, TP

N1=E1
N2=E2