Springer-Verlag, 2003. ISBN 3-540-44289-8, in German.
Abstract: The book deals with: - some introductory material on reachability, liveness, safety, invariants, the reachability and coverability graphs - a full proof for the decidability of the reachability problem - a comparison of liveness and reachability problems - a proof that the reachability problem is expspace hard - weak and strong computability with Petri nets - a characterisation of Petri net languages via closure properties - pomset and stepword behaviour of Petri nets - a calculus for building nets from places, transitions, arcs, and tokens and a compositional true-concurrency semantics for this calculus.