*p. xii: Sabina Petride should be added to the acknowledgements.

p. 36, line 11: the "inference rule!RC1 (Induction Rule)" after "Induction Rule" should be removed.

p. 46: In Exercise 2.17(a), the ev is missing a subscript M in parts (i), (ii), and (iii).

p. 50, line -6: the second "enable us to characterize in a precise
sense the complexity of" is redundant.

p. 78, line -7: Should read S' = {s} \union {s_\psi | K_1 \psi \in F} (the K_1 is missing).

p. 93, line -5: "all instances of A6 are true at a state s_V" should be
replaced by "\neg K_i \false \in V".

p. 99, line -4 (in Exercise 3.33): Replace K_n^D by S5_n^D.

p. 135, line 11: Delete the first "have."

p. 146, line -2: It should say "all events in r_i(m'')" not "all events
in r_i(m)".

p. 149: In the second line of Theorem 4.5.4, the \phi should be a \psi. Nine lines further down, the K_{i_{k-1}} ... K_1 should be K_{i_{k-1}} ... K_{i_k}. (That is, the subscript on the second K should be i_k, not 1.)

p. 156, line 4: It should be r(m'-k), not r(m-k).

p. 157, line 1: Replace "minimal such that" by "the first time that".

p. 158, line 1: Insert "that" after "such".

p. 179, line -2: replace "(strictly)" by "(weakly)"

p. 205, line 3: add "that" after "suppose".
p. 205, line 21: add "D^{um} is defined only on sets of positive
probability," after "we assume for simplicity that"
p. 205, line 24: the two occurrences of "payoff" should be replace by
"payoff' "

p. 217: In the statement of Theorem 6.4.2, if P is nondeterministic, we
must also require that n > t+1.  Otherwise, if n=t+1, consider the
protocol P that, if process 1 discovers that all the other processes
faulty before it has decided, nondeterminstically decides either 0 or 1
(and otherwise proceeds deterministically like a standard Byzantine
agreement protocol).  This protocol satisfies \sigma^{sba}, but it is
not the case that process 1 knows that is about decide 0 (or 1) when it
is about to do so, in a run where process 1 discovers that all other
processes are nonfaulty before it has decided.

p. 221, line 12: There's a missing subscript i on block.

p. 338: lines 18-19: Lines 18 and 19 should be switched. 

p. 426, line 19: At the end of the paragraph add the following sentence: In particular, it is not hard to show that a.m.p. systems have temporal imprecision.

p. 437, line 4: there's a ",,"; one of the commas should be removed.

p. 440, line 7: It should be "From \phi" not "From \psi".

p. 445: In the second line of Proposition 11.6.1(b), replace the second occurrence of \psi_{e(i)} by \psi_e, so that it says K_iC_G^\epsilon \psi_e.
Further down, on line -7, add "or a.r.m.p" after "the analysis of "a.m.p.". In the next line, it should say "a.r.m.p.", rather than "a.m.p.", and in the following line, remove "often". Eventual coordination can be achieved in a.r.m.p. systems, but not in a.m.p. systems.

p. 448, line 13: it should say "at least one message" (the "at" is
missing)

p. 454, line 5: there's an \epsilon \epsilon; the second \epsilon should be deleted.

p. 455: The "For" at the beginning of Exercise 11.4(a) should be
capitalized, as should the "Child" at the beginning of 11.4(b) and the
"If" at the beginning of 11.4(c). Finally, in the second line of
11.4(b), there should be a period, not a comma, after r.

p. 489: the first entry in the symbol index should be A, not A_i.