{"id":{"repo_id":"njit","oai_identifier":"oai:digitalcommons.njit.edu:theses-2247"},"canonical_url":"https://search.ndltd.org/etd/njit/oai:digitalcommons.njit.edu:theses-2247","repository":{"repo_id":"njit","name":"NJIT","base_url":"https://digitalcommons.njit.edu/do/oai/"},"display":{"title":"Techniques of petri net reduction","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Kalavapalli, Sreeranga"],"institution":null,"degree_name":"Master of Science in Computer Science - (M.S.)","degree_level":null,"degree_discipline":"Computer and Information Science","degree_department":null,"school":null,"contributors":["Daniel Y. Chao","David T. Wang","MengChu Zhou"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:40:41Z","subjects":["Petri Nets","Petri Nets Reduction","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.njit.edu/theses/1248","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.njit.edu/theses/1248","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.njit.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.njit.edu%3Atheses-2247","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Daniel Y. Chao","David T. Wang","MengChu Zhou"]},{"key":"dc:creator","label":"Author","values":["Kalavapalli, Sreeranga"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["1993-05-31T07:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer and Information Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Computer Science - (M.S.)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Petri Nets","Petri Nets Reduction","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.njit.edu/theses/1248"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Techniques of petri net reduction"]}]}],"canonical_facts":{"dc:contributor":["Daniel Y. Chao","David T. Wang","MengChu Zhou"],"dc:creator":["Kalavapalli, Sreeranga"],"dc:date.created":["1993-05-31T07:00:00Z"],"dc:description.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."],"dc:identifier":["https://digitalcommons.njit.edu/theses/1248"],"dc:subject":["Petri Nets","Petri Nets Reduction","Computer Sciences"],"dc:title":["Techniques of petri net reduction"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer and Information Science"],"thesis:degree_name":["Master of Science in Computer Science - (M.S.)"]},"updated_at":"2026-11-19T08:40:41Z"}