Concurrency Theory

General Information

Lecture

DateTopicMaterialRecording
Tu 2025-10-21Intro & OverviewSlides 01, Slides 02rec
Tu 2025-10-28EquivalenceSlides 03rec
Tu 2025-11-04Bisimulation and Weak BisimulationSlides 04, Handout 04, Slides 05, Handout 05rec
Tu 2025-11-11Properties of Weak Bisimulation, Fixed PointsSlides 06, Handout 06, Slides 07, Handout 07rec
Tu 2025-11-18Fixed Points, Induction, CoinductionSlides 07*, Handout 07*rec
Tu 2025-11-25ABP, Hennessy-Milner LogicSlides 08, Handout 08, Slides 09, Handout 09rec
Tu 2025-12-02HML with recursionSlides 10, Handout 10, Slides 11, Handout 11rec
Tu 2025-12-09Mutual recursion, Value-passing CCSSlides 12, Handout 12rec
Tu 2025-12-16Timed CCSSlides 13, Handout 13, Slides 14, Handout 14rec
Tu 2026-01-13Petri Nets, Interleaving semanticsSlides 15, Handout 15rec
Tu 2026-01-20Petri Nets, Concurrent semanticsSlides 16, Handout 16rec
Tu 2026-01-27Petri Nets, from guarded CCSSlides 17, Handout 17rec
Tu 2026-02-03Fundamentals of Session TypesSlides 18rec

Tutorial

DateTopicRecording
Mo 2025-11-03CCS Syntax & Semantics, LTS and Equivalencerec
Mo 2025-11-10Strong Bisimulationrec
Mo 2025-11-17Weak Bisimulationrec
Mo 2025-11-24Fixpoint Interpretation & Coinductionrec
Mo 2025-12-01HML Formulasrec
Mo 2025-12-08HML with Recursionrec
Mo 2025-12-15HML with Recursion & Value-Passing CCSrec
Mo 2026-01-12Exam Preparation (missing last 20min)rec
Mo 2026-01-19Petri Nets: Syntax & Semanticsrec
Mo 2026-01-26True Concurrency Semanticsrec
Mo 2026-02-02Petri Nets, CCS to Petri Nets and Session Typesrec

Exam

DateTimePlaceMode
2026-02-2313-15G 082 R 00 006written ∣ on paper ∣ closed book

Exercises

DateDueMaterial
Tu 2025-10-28Mo 2025-11-03Sheet01
Tu 2025-11-04Mo 2025-11-10Sheet02
Tu 2025-11-11Mo 2025-11-17Sheet03
Tu 2025-11-18Mo 2025-11-24Sheet04
Tu 2025-11-25Mo 2025-12-01Sheet05
Tu 2025-12-02Mo 2025-12-08Sheet06
Tu 2025-12-09Mo 2025-12-15Sheet07
Th 2025-12-20Mo 2026-01-12Sheet08
Tu 2026-01-13Mo 2026-01-19Sheet09
Tu 2026-01-20Mo 2026-01-26Sheet10
Tu 2026-01-27Mo 2026-02-02Sheet11