Date of Award

Spring 1993

Document Type

Thesis

Degree Name

Master of Science in Computer Science - (M.S.)

Department

Computer and Information Science

First Advisor

Daniel Y. Chao

Second Advisor

David T. Wang

Third Advisor

MengChu Zhou

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.

Share

COinS