Techniques of petri net reduction
Department of Computer and Information Science
Master of Science
Chao, Daniel Y.
Wang, David T.
Petri Nets Reduction
Petri Nets have the capability to analyze large and complex concurrent systems. However, there is one constraint. The number of reachability states of the concurrent systems outweighs the capability of Petri Nets. Previous Petri Net reduction techniques focussed on reducing a subnet to a single transition and hence not powerful enough to reduce a Petri Net. This paper presents six reduction rules and discusses their drawbacks. A new reduction technique called Knitting Technique to delete paths of a Petri Net while retaining all the properties of the original net is presented. Further Structural matrix which facilitates reduction is presented.
njit-etd1993-006 (64 pages -- 2,379 KB pdf)
Please complete this Feedback Form to inform us about your experience using this website. It will assist us in better serving your information needs in the future. Thank You!
If you have any questions please contact the Digital Projects Librarian
Created June 5, 2001