A study of deadlocks and traps in petri nets

dc.contributor.advisorOwens, Frank W.en_US
dc.contributor.authorBagga, Jayen_US
dc.date.accessioned2011-06-03T19:34:41Z
dc.date.available2011-06-03T19:34:41Z
dc.date.created1988en_US
dc.date.issued1988
dc.description.abstractPetri nets are used as models in the study of networks involving information flows. Petri nets have also turned out to be useful in the study of many asynchronous concurrent systems.In this thesis, the notions of deadlocks, traps, and liveness are considered from a graph theoretic viewpointA characterization of minimal deadlocks and traps in Petri nets is obtained. For the complete Petri nets, alternative characterizations of deadlocks and traps are obtained. Necessary and sufficient conditions are obtained for complete Petri nets to be deadlock free. Similar conditions for trap free complete Petri nets are also determined.
dc.description.degreeThesis (M.S.)
dc.description.sponsorshipDepartment of Computer Science
dc.format.extentiv, 34 leaves : ill. ; 28 cm.en_US
dc.identifierLD2489.Z78 1988 .B34en_US
dc.identifier.cardcat-urlhttp://liblink.bsu.edu/catkey/544009en_US
dc.identifier.urihttp://cardinalscholar.bsu.edu/handle/20.500.14291/183543
dc.sourceVirtual Pressen_US
dc.subject.lcshPetri nets.en_US
dc.subject.lcshGraph theory -- Data processing.en_US
dc.titleA study of deadlocks and traps in petri netsen_US
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.98 KB
Format:
Item-specific license agreed upon to submission
Description:
Collections