An Algorithm for Eliminating Duplicate Labels of a Labelled Petri Net

Labelled Petri nets or labelled nets are commonly used for system specification where the locations of conditions are denoted as places with condition labels and the locations of events as transitions with event labels. For unique representation of conditions and events, elimination of duplicate labels is required. In this paper, an algorithm is proposed for such purpose through the fusion of common subnets. The algorithm has three distinctive features. First, the units of fusing are subnets instead of individual places and transitions. Second, the groups of common subnets identified for fusing are maximal and disjoint so that the fusion need to be done only once. Third, the fusion preserves firing sequences so that the specified system behaviours will not be altered.