Automated Modelling of Deadlock-free Petri Nets Using Duplicated Transition Labels

The paper addresses the problem of automated synthesis of deadlock free Petri nets (PN) from event sequences. A method for determining substructures that yield deadlocks is presented. Based on structural patterns that may appear during the synthesis of PN from some types of event sequences, deadlock substructures, called inconsistent, are detected. Afterwards, a repairing technique is applied to correct every inconsistent substructure by adding a new transition, which is associated to an event symbol already assigned to a transition in the inconsistent substructure. The algorithms derived from the technique, which have polynomial-time complexity, have been implemented and tested on examples of diverse structures.