Study on Function Partition Strategy of Petri Nets Parallelization

Abstract

In order to solve the parallel algorithm for Petri net system with concurrent function, to realize the parallel control and execution of Petri net, two different functional partition strategies based on P- invariant and T- graph are proposed for the parallel algorithm of Petri net system. Firstly, after the analysis of Petri net model and concurrent function, the basic idea of P/T network system function of parallel is proposed. Secondly, algebraic method of P- invariant and homogeneous linear equations are used to describe the P/T net parallel mathematical model and its formal process, the Petri net parallel function partition strategy based on P- invariants, model segmentation, conditions of creating process, and parallelization analysis are given with theoretical proof and example verification. Then the concept of T- graph is defined from the perspective of transition, the subnet partition principle, subnet partition conditions on Petri net model and parallelization analysis are put forward with theoretical proof and example verification. Finally, the natures of these two kinds of Petri net function partition strategy: the P- invariant and T- graph are compared, their advantages and disadvantages are evaluated. Hence, efficient partition strategy is provided for Petri nets parallelization.