Verification of Nonblockingness in Bounded Petri Nets: A Novel Semi-Structural Approach
share
This paper proposes a semi-structural approach to verify the nonblockingness of a Petri net. We provide an algorithm to construct a novel structure, called minimax basis reachability graph (minimax-BRG): it provides an abstract description of the reachability set of a net while preserving all information needed to test if the net is blocking. We prove that a bounded deadlock-free Petri net is nonblocking if and only if its minimax-BRG is unobstructed, which can be verified by solving a set of integer linear programming problems (ILPPs). For Petri nets that are not deadlock-free, one needs to determine the set of deadlock markings. This can be done with an efficient approach based on the computation of maximal implicit firing sequences enabled by the markings in the minimax-BRG. The approach we developed does not require exhaustive exploration of the state space and therefore achieves significant practical efficiency, as shown by means of numerical simulations.
READ FULL TEXT