DefinePK

Abstract

With the decomposition method of Petri net by assigning an index of the transition set, a structure-complex net system can be decomposed to a set of structure-simple subnets, named T-net. There is a projection relation of the reachable marking set and languages between the original net system and the subnet systems decomposed. However, some unnecessary states and languages are also added in the subnet systems. This study presents the deep research results on the decomposition method of Petri nets based on the index of transitions. A set of necessary and sufficient conditions for keeping the states and languages invariant between the original system and the subnet systems is obtained. Based on the simplified reachable marking graph, an algorithm is given to decide the states and languages invariant.