‘Firing Sequence’ as a Tool for the Analysis of Petri Nets

摘要

In this paper, a new tool is known as the `firing sequence' is introduced for the analysis of Petri nets. Firing sequence is proposed as a supplement to the well-known `reachability tree.' Firing sequence is implemented in the General-purpose Petri net Simulator (GPenSIM). For analyzing Petri nets, this paper proposes performing the analysis with the reachability tree as a starting point. If the reachability tree indicates any deadlocks, then firing sequence can be used to verify the possibility of getting into the deadlock state. By using the firing sequence, the firing conditions (the external variables) can also be taken into account, which is not possible with the reachability tree. Also, the firing sequence incorporates firing times of the transitions, thus provides the time perspective in the analysis, which is also not possible in the reachability tree analysis.