Generating basis siphons and traps of Petri nets using the sign incidence matrix

This paper introduces a new matrix called the sign incidence matrix for Petri nets. Using this sign incidence matrix, we present a simple algorithm for generating all basis siphons or traps without first generating all siphons or traps. Any siphon (trap) can be expressed as an union of basis siphons (basis traps). The concept of siphons and traps plays an important role in the analysis of Petri nets. In particular, criteria for liveness and reachability of some subclasses of Petri nets can be stated in terms of siphons and traps