A Simplifying Technology On The Petri Net

For the big and complicated Petri net, the mainly problem hindering the technologydevelopment is always " too much nodes lead to station explosion”. So how to simplify Petrinet effectively has always been a research focus and simplify it to be several subnets is a veryeffective method. From the recent research situation, the study of reduction technique of Petrinet mainly focus on the following three aspects:Level simulation and neglected details basedon Petri net;Reduction technique based on Petri net;Decomposition technique Petri net.Among those, the decomposition technique of Petri net is the mainstream direction ofPetri net’s reduction technique and the most effective approach to solve the problem of“station explosion”.The thesis mainly studies the decomposition technique of Petri net. It propose theconcept of index function, show its’formal definition. Based on the formal definition we putforward a decomposition definition of Petri net, show the relative algorithm, and makecomparison between the traditional algorithms and the algorithm to reflect its’superiority.Based on the given algorithms, it studies the dynamic characteristics of decompositiontechnique and presents a deep analysis of dynamic library, liveness, boundedness, safety andfairness. It then proves strictly the keeping relationship of the above characteristics betweenthe original net and the decomposed subnet based on the algorithm. To show the effectivenessof the algorithm vividly, it presents examples.Finally, it uses the algorithm to research behaviors in producer-consumer system andmultiprocessor system. From that, it shows the convenience of the algorithm in analysis onpractical problems.