Not intended to be a detailed transcript of each class meeting, but rather a brief description and possibly some pointers to sources.
Finish Chapter 3 with impos0.pdf. Questions about current homework? Moving on next to Chapter 7 of Distributed Algorithm book.
The class meeting starts with another TLC demonstration (notes intlc2.pdf) which shows how to deal with n-process mutual exclusion (some new TLA notation is used). Then the algorithms from Chapter 3 of the Distributed Algorithm book.
First Exam. Then a demonstration of TCL, transcript in tlc1.pdf
Covering Chapter 3 of the TLA book. See notes in logic2.pdf.
Class meeting introduced the problem of mutual exclusion, based on these notes. Also, each student invited to email office hours preference to instructor.
Syllabus and general description of the situation in distributed computing. Some sources (textbooks, notes, papers). Mention of some topics. The course will provide background on research in an active topic, namely (theory of) distributed systems. Some topics even generate debate.