Known Errors in Vol.1:
Basic Concepts (1. and 2. edition)
The list only contains errors that may influence the understanding of the text. This means that we omit, e.g., trivial spelling mistakes.
Page 100, Fig. 3.6
Place Inactive in EstabCon#2 should be an I/O port (instead of an In port)
Page 109, part (v) of Fig. 3.10
PT should map the port node In@Dia#3 into in (instead of i/o)
Page 124, first line after Def. 4.1
each hierarchical CP-net ---> each non-hierarchical CP-net
Page 124, first line after Def. 4.2
a hierarchical CP-net ---> a non-hierarchical CP-net
Page 134, Data base system
Transitions SM and RA are strictly live, while RM and SA are only live (since they never can occur for a binding in which s=r). If we add the guard [s<>r] to RM and SA, the data base system becomes strictly live.
Page 134, Telephone system
The CP-net is live ---> The CP-net is strictly live
Page 135-137, Fairness properties
For the fairness properties, we only consider occurrence sequences that start in a reachable marking
Page 183, middle of page
As an example, consider the data base system of. Sect. 1.3 ---> As an example, consider the ring protocol of. Sect. 3.1
Page 188-189, Fig. 6.13 and Fig. 6.14
The first line in the declaration node (definetime int start 0) should be deleted.
Page 195, lines 6-7
being constructed ---> being processed
Reference list
The following references have been updated:
36. A. Finkel: The Minimal Coverability Graph for Petri Nets. In:
G. Rozenberg (ed.): Advances in Petri Nets 1993, Lecture Notes in Computer
Science Vol. 674, Springer-Verlag 1993, 210234.
55. K. Jensen, et. al: Design/CPN. A Reference Manual. Meta Software
and Computer Science Department, University of Aarhus, Denmark. On-line
version: http://www.daimi.aau.dk/designCPN/.
56. K. Jensen, et. al.: Design/CPN Occurrence Graph Manual. Meta
Software and Computer Science Department, University of Aarhus,
Denmark. On-line version: http://www.daimi.aau.dk/designCPN/.
69. M. Lindqvist: Parameterized Reachability Trees for
Predicate/Transition Nets. In: G. Rozenberg (ed.): Advances in Petri Nets
1993, Lecture Notes in Computer Science Vol. 674, Springer-Verlag 1993,
301324. Also in [59], 351372.
115. A. Valmari: Stubborn Sets of Coloured Petri Nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus 1991, 102121.
If you find new errors, please send me an e-mail.
Modification Date?