Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net theory in 1962. A substantial amount of work utilizing and modifying the Petri nets has been done since then, and they have turned out to be very useful in the study of asynchronous concurrent systems. The liveness and reachability problems are considered to be some of the major problems in Petri net theory.Since the structure of a Petri net can be regarded as sets of places and transitions form a graphical point of view, this thesis is concerned with utilizing the results of graph theory to investigate the liveness in terms of deadlock problems of a special subclass of Petri nets, free-choice Petri nets. As a subclass of Petri nets, the class of free-choice Petri nets possesse relatively strong analysis properties. This is especially true of complete free-choice Petri nets. We show in particular that any system which can be modeled by a general Petri net can also be modeled by a free-choice Petri net. / Department of Computer Science
| Identifer | oai:union.ndltd.org:BSU/oai:cardinalscholar.bsu.edu:handle/184201 |
| Date | January 1991 |
| Creators | Jin, Wei |
| Contributors | Ball State University. Dept. of Computer Science., Bagga, Kunwarjay S. |
| Source Sets | Ball State University |
| Detected Language | English |
| Format | ii, 34 leaves : ill. ; 28 cm. |
| Source | Virtual Press |
Page generated in 0.0019 seconds