New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes

摘要

In this paper, a new kind of behavior-preserving transition insertions in Petri nets is proposed, and a method for computing the useful and valid transition insertions using a complete unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) re-unfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.