Account
Edit tools
Intern
SucheSearch
English

Concurrency Theory (SS2025): Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
(added schedule)
Stephan Mennicke (Diskussion | Beiträge)
(schedule update)
Zeile 83: Zeile 83:
}}
}}
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Entfällt
|Title=Algebraic Properties of Equivalences
|Title=Easter Tuesday
|Room=APB E005
|Room=APB E005
|Date=2025/04/22
|Date=2025/04/22
Zeile 98: Zeile 98:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Efficient Algorithms for Checking Bisimilarity
|Title=Algebraic Properties of Equivalences
|Room=APB E005
|Room=APB E005
|Date=2025/04/29
|Date=2025/04/29
Zeile 112: Zeile 112:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Hennessy-Milner Logic and Bisimilarity
|Title=Efficient Algorithms for Checking Bisimilarity
|Room=APB E005
|Room=APB E005
|Date=2025/05/06
|Date=2025/05/06
Zeile 126: Zeile 126:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Model mu-Calculus
|Title=Hennessy-Milner Logic and Bisimilarity
|Room=APB E005
|Room=APB E005
|Date=2025/05/13
|Date=2025/05/13
Zeile 140: Zeile 140:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Efficient Algorithms for Checking Bisimilarity (2)
|Title=Model mu-Calculus
|Room=APB E005
|Room=APB E005
|Date=2025/05/20
|Date=2025/05/20
Zeile 154: Zeile 154:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Properties of Petri Nets
|Title=Efficient Algorithms for Checking Bisimilarity (2)
|Room=APB E005
|Room=APB E005
|Date=2025/05/27
|Date=2025/05/27
Zeile 168: Zeile 168:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=The Coverability Problem
|Title=Properties of Petri Nets
|Room=APB E005
|Room=APB E005
|Date=2025/06/03
|Date=2025/06/03
Zeile 196: Zeile 196:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Region Theory
|Title=The Coverability Problem
|Room=APB E005
|Room=APB E005
|Date=2025/06/17
|Date=2025/06/17
Zeile 210: Zeile 210:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Petri Net Languages
|Title=Region Theory
|Room=APB E005
|Room=APB E005
|Date=2025/06/24
|Date=2025/06/24
Zeile 224: Zeile 224:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Petri Net Processes
|Title=Petri Net Languages
|Room=APB E005
|Room=APB E005
|Date=2025/07/01
|Date=2025/07/01
Zeile 238: Zeile 238:
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Übung
|Title=Towards Mobile Processes (2)
|Title=Petri Net Processes
|Room=APB E005
|Room=APB E005
|Date=2025/07/08
|Date=2025/07/08
Zeile 251: Zeile 251:
}}
}}
{{Vorlesung Zeiten
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Übung
|Lehrveranstaltungstype=Entfällt
|Title=Probably no Exercise Session
|Title=Probably no Exercise Session
|Room=APB E005
|Room=APB E005

Version vom 25. März 2025, 10:53 Uhr

Concurrency Theory

Lehrveranstaltung mit SWS 2/2/0 (Vorlesung/Übung/Praktikum) in SS 2025

Dozent

Umfang (SWS)

  • 2/2/0

Module

Leistungskontrolle

  • Mündliche Prüfung
Matrix-Kanal

Vorlesungsreihe


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.

Veranstaltungskalender abonnieren (icalendar)

Vorlesung Introduction and Motivation DS4, 7. April 2025 in APB E005 Datei
Vorlesung Linear Time vs. Branching Time DS3, 8. April 2025 in APB E005 Datei
Vorlesung Bisimilarity and All That DS4, 14. April 2025 in APB E005 Datei
Übung The Linear Time - Branching Time Spectrum (1) DS3, 15. April 2025 in APB E005 Datei
Entfällt Easter Monday DS4, 21. April 2025 in APB E005
Entfällt Easter Tuesday DS3, 22. April 2025 in APB E005
Vorlesung The Calculus of Communicating Systems DS4, 28. April 2025 in APB E005 Datei
Übung The Linear Time - Branching Time Spectrum (2) DS3, 29. April 2025 in APB E005 Datei
Vorlesung Algebraic Properties of Bisimilarity DS4, 5. Mai 2025 in APB E005 Datei
Übung CCS and Bisimilarity DS3, 6. Mai 2025 in APB E005 Datei
Vorlesung Checking Bisimilarity is Complete for P DS4, 12. Mai 2025 in APB E005
Übung Algebraic Properties of Bisimilarity DS3, 13. Mai 2025 in APB E005 Datei
Vorlesung Checking Bisimilarity is (Un-)Decidable DS4, 19. Mai 2025 in APB E005
Übung Hennessy-Milner Logic and Bisimilarity DS3, 20. Mai 2025 in APB E005
Vorlesung Everything you always wanted to know about Petri Nets DS4, 26. Mai 2025 in APB E005
Übung Efficient Algorithms for Checking Bisimilarity (2) DS3, 27. Mai 2025 in APB E005
Vorlesung What is Decidable about Petri Nets? DS4, 2. Juni 2025 in APB E005
Übung Properties of Petri Nets DS3, 3. Juni 2025 in APB E005
Entfällt Pentecost Week DS4, 9. Juni 2025 in APB E005
Entfällt Pentecost Week DS3, 10. Juni 2025 in APB E005
Vorlesung The Complexity of Petri Nets (1) DS4, 16. Juni 2025 in APB E005
Übung The Coverability Problem DS3, 17. Juni 2025 in APB E005
Vorlesung The Complexity of Petri Nets (2) DS4, 23. Juni 2025 in APB E005
Übung Region Theory DS3, 24. Juni 2025 in APB E005
Vorlesung The Complexity of Petri Nets (3) DS4, 30. Juni 2025 in APB E005
Übung Petri Net Languages DS3, 1. Juli 2025 in APB E005
Vorlesung Towards Mobile Processes (1) DS4, 7. Juli 2025 in APB E005
Übung Petri Net Processes DS3, 8. Juli 2025 in APB E005
Vorlesung Summary and Outlook DS4, 14. Juli 2025 in APB E005
Entfällt Probably no Exercise Session DS3, 15. Juli 2025 in APB E005


Kalender

















Abgerufen von „https://iccl.inf.tu-dresden.de/w/index.php?title=Concurrency_Theory_(SS2025)&oldid=42048“