PROGRAMMING DISTRIBUTED COMPUTING SYSTEMS

A Foundational Approach

Carlos A. Varela, Programming Distributed Computing Systems -- A Foundational Approach, MIT Press, Cambridge, MA:May 2013 (Available from Amazon and MIT Press).

Errata

Page

Section

Corrections

8 1.4.3 Current Text:
Consider n philosophers, Ph1,...,Phn, dining at a round table containing n chopsticks ch1,...,chn ...


Corrected Text:
Consider n philosophers, Ph0,...,Phn-1, dining at a round table containing n chopsticks ch0,...,chn-1 ...

67 4.2.4 Current Text:
Unfair computation paths, where enabled transitions never happen, are ruled out.


Corrected Text:
Unfair computation paths, where infinitely-often enabled transitions never happen, are ruled out.

77 4.6 Exercises (Exercise 4.) Current Text:
mkrelease = λp.nil


Corrected Text:
mkrelease = λp.pr(p, nil)

200 9.4.3
(Figure 9.20) 		Current Text:
Philosopher{Chopstick left, Chopstick right){


Corrected Text:
Philosopher(Chopstick left, Chopstick right){