Graph-Theoretical Structure of Petri Nets
摘要
By imposing restrictions on the bipartite graphs that may occur as Petri nets, it is possible to distinguish certain classes of nets whose behavioural analysis is more easily possible than for the full class of nets. In this chapter, the focus is on three such classes: S-systems, T-systems, and FC- (free-choice) systems.