Page 152: Line -16: replace „safe” by „live and safe”. Line -15: it is actually the same example. A different example (with fewer reachable markings) can be found in Piotr Chrzastowski-Wachtel and Piotr Ulanowski: „Some Petri Net Problems with Counterintuitive Solutions”, Proc. PeNGE’24 Workshop.

Page 198: Lines 6-8: Here, a correspondence is suggested between the notion of „impartiality” defined in one of the seminal papers on fairness [LPS81] and „weak fairness” as defined in Section 8.5. This correspondence seems shaky, because Proposition 5.18 states that „every strongly fair sequence is also weakly fair”, while [LPS81] state on page 276 that „every impartial computation is also a [strongly] fair computation”. It may also be debatable whether [LPS81]’s notion of „justice” corresponds to one hundred percent to the „finite delay property” as defined in Section 8.5, but these two notions certainly seem close to each other. The authors are grateful to Rob van Glabbeek for pointing out the above on June 28, 2024, during the annual Petri Net Conference in Genève, Switzerland, at which he was an Invited Speaker.

Page 275: Line 14: replace „sparation” by „separation”.

Page 295: Line 10: replace „to” by „the”.

Page 380: Lines 6-7: replace „mutliplication” by „multiplication”.

Page 394: Footnote 12: Replace „\(\mathcal{R}\)” by „the set \(\mathcal{R}\)”.

Pages 375 – 397: Replace Chapter 17 by THIS, for two reasons: (i) Embellishment: The letter \(F\) has been somewhat overloaded in this chapter. While it is easy to spot throughout what was meant, it is cleaner to use a dedicated letter \(\mathcal{F}\) for the set of minimal nondecreasing firing sequences in Definition 17.16. (ii) Modification: The proof of Theorem 17.23 has been reworked to include the effective constructibility of \(\mathcal{F}\). If you are only interested in the modified proof, a two-page version closer to the printed book can be found HERE.