Page 152: Line -16: replace ‘safe’ with ‘live and safe’. Line -15: it is actually the same example. An example of non-asymmetric choice with fewer reachable markings can be found in Piotr Chrzastowski-Wachtel and Piotr Ulanowski: ‘Some Petri Net Problems with Counterintuitive Solutions’, Section 5, 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 appears tenuous, as Proposition 5.18 states that ‘every strongly fair sequence is also weakly fair’, whilst [LPS81] states 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 one hundred per cent to the ‘finite delay property’ as defined in Section 8.5, but these two notions certainly appear to be closely related. The authors are grateful to Rob van Glabbeek for pointing out the above on 28 June 2024, during the annual Petri Net Conference in Geneva, Switzerland, at which he was an invited speaker.

Page 275: Line 14: replace ‘sparation’ with ‘separation’.

Page 295: Line 10: replace ‘to’ with ‘the’.

Page 380: Lines 6–7: replace ‘mutliplication’ with ‘multiplication’.

Page 394: Footnote 12: Replace ‘\(\mathcal{R}\)’ with ‘the set \(\mathcal{R}\)’.

Pages 375–397: Replace Chapter 17 with THIS, for two reasons: (i) Clarification: The letter \(F\) has been somewhat overused in this chapter. Whilst it is easy to discern the intended meaning throughout, it is clearer to use a dedicated letter \(\mathcal{F}\) for the set of minimal non-decreasing 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.

Page 60: Line -15: The double dash in \({\scriptsize M''}\) should be removed.

Lines -13 and -11: the slash above the arrow should be removed (what is meant is a \({\small j}\)-fold repetition of the sequence \({\small \sigma}\)).

Page 173, line 22: Replace ‘oder’ with ‘order’.

Page 346, Line 17: \({\small \sigma_1}\), instead of \({\small \sigma1}\).

Page 392, line -8: the net satisfies the asymmetric choice property, but it is not plain.