Concurrency Theory
From International Center for Computational Logic
Concurrency Theory
Course with SWS 2/2/0 (lecture/exercise/practical) in SS 2025
Lecturer
SWS
- 2/2/0
Modules
Examination method
- Oral exam
Lecture series
Course Description
Modern computer systems are often multi-threaded or even fully distributed over several machines and geographic locations. Instead of computation (e.g., in Turing machines, λ-calculus, etc.), the key notion for describing concurrent computations is interaction leading to the concept of processes. In this course, we study several phenomena occurring in concurrent computations using process calculi, for which we will define and analyze their formal semantics. As one of the key aspects, we ask when two processes are considered to be equivalent. Subsequently, we give an (incomplete) list of topics we strive for throughout the course.
- From sequential to parallel processes (LTS, CCS)
- Bisimulation and Coinduction
- From sequential to concurrent processes (Petri nets)
- Mobile processes (the π-calculus)
- Expressive power of process calculi
- Data-Aware Processes
Contact
If you have questions about the course, feel free to ask in the matrix chat or email the teacher(s).
Schedule and Location
The course is taught in two sessions per week,
* weekly lecture sessions will happen on Mondays DS4 (13.00-14.30) * weekly exercise sessions happen on Tuesdays DS3 (11.10-12.40).All the sessions take place in APB E005. We're currently planning the course sessions as on-site events. If necessary, we can retract to an Online mode, probably using Zoom.
- Aceto, L., Ingólfsdóttir, A., Larsen, K. G., & Srba, J. (2007). Reactive Systems. Cambridge University Press.
- Sangiorgi, D., & Walker, D. (2003). The pi-calculus: a theory of mobile processes. Cambridge University Press.
- Sangiorgi, D. (2012). Introduction to bisimulation and coinduction. Cambridge University Press.
- Milner, R. (1980). A calculus of communicating systems. : Springer Berlin Heidelberg.
- Milner, R. (1999). Communicating and mobile systems. : Cambridge University Press.
- Davide Sangiorgi (2012). Advanced topics in bisimulation and coinduction. : Cambridge University Press.
* especially chapter 3 on "Algorithmics of Bisimilarity" by Luca Aceto et al.
- Reisig, W. (2013). Understanding Petri Nets. : Springer Berlin Heidelberg.
- Esparza, J. Petri Nets Lecture Notes from a course given at TU Munich Link to the Script
Subscribe to events of this course (icalendar)
| Lecture | Introduction and Motivation | DS4, April 7, 2025 in APB E005 | File |
| Lecture | Linear Time vs. Branching Time | DS3, April 8, 2025 in APB E005 | File |
| Lecture | Bisimilarity and All That | DS4, April 14, 2025 in APB E005 | File |
| Exercise | The Linear Time - Branching Time Spectrum (1) | DS3, April 15, 2025 in APB E005 | File |
| No session | Easter Monday | DS4, April 21, 2025 in APB E005 | |
| No session | Easter Tuesday | DS3, April 22, 2025 in APB E005 | |
| Lecture | Algebraic Properties of Bisimilarity | DS4, April 28, 2025 in APB E005 | |
| Exercise | The Linear Time - Branching Time Spectrum (2) | DS3, April 29, 2025 in APB E005 | File |
| Lecture | Bisimilarity and Testing | DS4, May 5, 2025 in APB E005 | |
| Exercise | Algebraic Properties of Equivalences | DS3, May 6, 2025 in APB E005 | |
| Lecture | Checking Bisimilarity is Complete for P | DS4, May 12, 2025 in APB E005 | |
| Exercise | Efficient Algorithms for Checking Bisimilarity | DS3, May 13, 2025 in APB E005 | |
| Lecture | Checking Bisimilarity is Undecidable | DS4, May 19, 2025 in APB E005 | |
| Exercise | Hennessy-Milner Logic and Bisimilarity | DS3, May 20, 2025 in APB E005 | |
| Lecture | Everything you always wanted to know about Petri Nets | DS4, May 26, 2025 in APB E005 | |
| Exercise | Efficient Algorithms for Checking Bisimilarity (2) | DS3, May 27, 2025 in APB E005 | |
| Lecture | What is Decidable about Petri Nets? | DS4, June 2, 2025 in APB E005 | |
| Exercise | Properties of Petri Nets | DS3, June 3, 2025 in APB E005 | |
| No session | Pentecost Week | DS4, June 9, 2025 in APB E005 | |
| No session | Pentecost Week | DS3, June 10, 2025 in APB E005 | |
| Lecture | The Complexity of Petri Nets (1) | DS4, June 16, 2025 in APB E005 | |
| Exercise | The Coverability Problem | DS3, June 17, 2025 in APB E005 | |
| Lecture | The Complexity of Petri Nets (2) | DS4, June 23, 2025 in APB E005 | |
| Exercise | Region Theory | DS3, June 24, 2025 in APB E005 | |
| Lecture | The Complexity of Petri Nets (3) | DS4, June 30, 2025 in APB E005 | |
| Exercise | Petri Net Languages | DS3, July 1, 2025 in APB E005 | |
| Lecture | Towards Mobile Processes (1) | DS4, July 7, 2025 in APB E005 | |
| Exercise | Petri Net Processes | DS3, July 8, 2025 in APB E005 | |
| Lecture | Summary and Outlook | DS4, July 14, 2025 in APB E005 | |
| No session | Probably no Exercise Session | DS3, July 15, 2025 in APB E005 |
Calendar
