Reversibility verification of Petri nets using unfoldings

Discrete event systems are modeled compactly by using Petri nets (T. Murata, 1989). Although Petri nets have powerful mathematical verification ability, in many cases, we have to construct the whole state space for verification. A reachability graph is one of the representations of the state space. Petri nets can describe huge systems compactly, but sometimes it is impossible to generate the reachability graph because of an explosion in required computational time and space. A Petri net is called a reversible net, when it can come back to the initial marking from any reachable marking. The paper considers a verification method for reversibility. An unfolding is obtained by unfolding a Petri net, and it preserves reachability information of an original net and structural analysis on it is much easier than on the original net. The article clarifies relations between unfoldings and reversibility, and provides a verification method for reversibility by using unfoldings