Nothing is perfect. Known mistakes are listed below. Please send us any mistakes you spot by email: email@example.com
Second edition errata
- Fig. 2.2, page 42: The label “Procure Products” is wrong, it should be “Produce Products”.
- Fig. 2.3, page 43: The label “Procure Products” is wrong, it should be “Produce Products”.
- Page 44: “All of these different production variants refer
to the single “Procure Products” element in Figure 2.3.” should be “…to the single “Handle Job Application” element…”
- Page 44: “includes order booking, billing, shipment, and delivery” should be “includes order booking, billing, shipment, and payment”
- Figure 3.16, page 100. The labels on the sequence flow coming out from
the first exclusive gateway switched. Labels “product in stock” and “product
not in stock” should be swapped.
- Page 102: the activity “Make payment” is not featured in the example in Fig. 3.16. The text should be: “Make payment” (not present in Fig. 3.16).” An example of incoming message for this activity would be “Payment details” (received upon activity start), while and example of outgoing message would be “Payment”(sent upon activity completion).
- Figure 5.15(b), the gateway that comes after task “Handle Dispatch Advice”
should be a parallel join gateway (AND-join) and not an exclusive merge
- Solution 5.15, pp. 203-204, “Second, after the handling of a change request,
the process should resume from the order checking, but the model
suggests that the order registration is also to be repeated.” This statement
is incorrect and should be deleted. In the process model in Figure 5.14, the
order registration is never repeated.
- Chapter 6.3, page 235, “PICK is an acronym standing for Possible, Implement,
Challenge, and Kil.” The last word should be “Kill”.
- Chapter 7.1.2, page 262, “calculate the so-called the Theoretical” should be “calculate the so-called Theoretical” (there has to be one “the” less)
- Chapter 7.1.2, page 262, Example 3.7 (page 90). The pointer should refer to Example 3.7 (page 91).
- Chapter 7.1.4, page 266, Footnote 1, first sentence: the word “throughout” should be “throughput”.
- Footnote 2, pp. 267, “used a synonym” should be “used as synonym”.
- Chapter 7.1.6, page 272, Example 3.7 (page 90). The pointer should refer to Example 3.7 (page 91).
- Exercise 8.20 refers to Example 6.15, but there is no Example 6.15 in the
book. Instead, Exercise 8.20 should refer to Exercise 6.15.
- Solution 8.5 is lacking the answer to the fourth item in Exercise 8.5.
The missing answer is as follows:
A robot carries out part of a surgical procedure, in this way replacing an activity that was previously completely carried out by a surgeon.”: Above all, this can lead to an improvement in quality, as the robot is likely to be more accurate and consistent in its interventions. Costs are likely to be higher, at least in the short term, due to the high costs of development and maintenance of such surgical robots. The time of the surgery might be reduced.
- Solution 9.6, page 366: The answer should be:
- auditing agency: Rule Enforcement
- company clients: Execution Transparency
- insurance organization: Flexible System Integration
- On page 378, Exercise 10.4 points at Exercise 10.2 (page 375). It should
be page 376.
- Solutions to exercises, pp. 403–404, the numbering of solutions 10.4 to 10.7
is incorrect. The correct numbering is as follows:
- Solution 10.4 should be Solution 10.7
Solution 10.5 should be Solution 10.4
Solution 10.6 should be Solution 10.5
Solution 10.7 should be Solution 10.6
- Solution 10.4 should be Solution 10.7
- Exercise 10.12, page 406, “Identify which of these models…” should be “Identify which of these processes…”
- Section 11.4, page 432, description of the alpha algorithm, step 5.b) should read: Eliminating b→d and c→d if there exists some (b#c)→d.
- Figure 11.12, page 437, the set of potential task connections, XL, for the given log does not contain any direct succession between c and f; there should not be the two XOR gateways between c and f.
- Figure 11.20, page 455, in the third process model (from the top), just before the AND-split gateway, it is written c=11 and p=0, but it should be c=1 and p=1.
- Solution 11.5, pp. 466, “Therefore, we get L = f [a, b, g, h, j, k, i, l], [a, c,
d, e, f, g, j, h, i, k, l], 2 [a, c, f, g, j, h, i, k, l].” This solution is incorrect.
The solution states that the third trace occurs twice, but it occurs only once.
On other hand hand, the first trace occurs twice (trace 1 and trace 4 have the
same sequence of activities). Hence the correct solution is: L = [a, b,
g, h, j, k, i, l], [a, c, d, e, f, g, j, h, i, k, l], [a, c, f, g, j, h, i, k, l].
- Exercise 11.20, page 470, “Consider the following event log…” In this sentence, the “following event log” refers to the event log shown in the table in the next page (page 471).
The errata for the first edition of our book can be downloaded here.