Course Schedule
Lectures happen twice a week:
- Wed 16-18 at Law Theatre G23 (K-F8-G23)
- Fri 11-13 at Law Theatre G02 (K-F8-G02)
This is a tentative course schedule, which will evolve during the semester.
| Week | Topic | Homework | Assignments |
| 1 | Course Overview, Concurrent Semantics, Promela, Temporal Logic | Theory: Temporal Logic | |
| 2 | Critical Section Problem, Fairness, Proof Methods | Practical: Promela Modelling | Assn0 Released |
| 3 | Critical Section Algorithms, Szymanski's Algorithm | Theory: Critical Sections | Assn0 Due |
| 4 | Semaphores and Monitors | Practical: Semaphore and Monitor Problems | Assn1 Released |
| 5 | Message Passing, Non-Compositional Proof Methods, Termination and Convergence | Practical: Message-Passing Problems | |
| 6 | Flexibility Week | ||
| 7 | Compositionality, CCS, Process Algebra | Theory: Message-Passing Proofs | Assn1 Due |
| 8 | Distributed Algorithms, Byzantine and Crash Failure | Theory: Distributed Algorithms | Assn2 Released |
| 9 | Consensus and Commitment, Global Properties | Practical: Distributed Algorithms | |
| 10 | Revision | Assn2 Due |
\(\;\)