models for concurrency
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…).
