This book provides the primary knowledge of Petri net theory and Petri-nets based model checking methods. As for the Petri net theory, it involves the interleaving semantics and concurrency semantics of elementary net systems, some important net structures (e.g. invariant, repetitive vector, siphon, and trap), some classical net subclasses with special structures (e.g. state machine, marked graph, free-choice net, asymmetric-choice net, normal net, and weakly persistent net), and some basic properties (e.g. reachability, liveness, and deadlock). It also involves four high-level Petri nets: knowledge-oriented Petri nets, Petri nets with insecure places, time Petri nets, and plain time Petri nets with priorities, focusing on different application fields. As for the model checking methods, this book introduces computation tree logic, computation tree logic of knowledge, timed computation tree logic, as well as the Petri-nets based checking methods for them.

The basic principle of the reduced ordered binary decision diagram is also involved in this book in order to compress the state space used in these model checking procedures. This book also presents time-soundness for time Petri nets and secure bisimulation for Petri nets with insecure places. They are both based on the bisimulation theory. This book consequently introduces the basic knowledge of this theory.