The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title:	Techniques of petri net reduction
Author:	Kalavapalli, Sreeranga
View Online:	njit-etd1993-006 (viii, 23 pages ~ 2.3 MB pdf)
Department:	Department of Computer and Information Science
Degree:	Master of Science
Program:	Computer Science
Document Type:	Thesis
Advisory Committee:	Chao, Daniel Y. (Committee chair) Wang, David T. (Committee member) Zhou, MengChu (Committee member)
Date:	1993-05
Keywords:	Petri Nets Petri Nets Reduction
Availability:	Unrestricted
Abstract:	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.