Abstract
dc:description.abstractPetri 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Computer Science - (M.S.)
- Discipline thesis:degree_discipline
- Computer and Information Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kalavapalli, Sreeranga
- Contributors dc:contributor
-
- Daniel Y. Chao
- David T. Wang
- MengChu Zhou
Subjects
dc:subject × 3Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.njit.edu/theses/1248