On fairness and conflicts in Petri nets

R. S. Sreenivas, B. H. Krogh

Research output: Contribution to conferencePaperpeer-review

Abstract

The notions of fairness and conflicts in live, bounded, and strongly connected Petri nets (PNs) are formally related . The PN model of a resource-sharing concurrent system (RSCS) is conflict free when the firing of an enabled transition does not disable another transition in the net. Conflicts in the PN represent unresolved resource allocation conditions. The PN is fair when the firing of any transition more than a given number of times is a sufficient condition for all the transitions in the net to have fired. When the PN is fair, no process in the system can be starved; that is, resources are allocated so that all tokens progress through the net. Although these concepts are not equivalent, it is shown that they are strongly related to each other when the PN model is live, bounded, and strongly connected. A computational method for finding conflicts is presented, and the concepts are illustrated with an example of buffer allocation in a sorting algorithm.

Original languageEnglish (US)
Pages406-409
Number of pages4
StatePublished - Dec 1 1990
Externally publishedYes
EventProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) - Champaign, IL, USA
Duration: Aug 14 1989Aug 16 1989

Other

OtherProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2)
CityChampaign, IL, USA
Period8/14/898/16/89

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'On fairness and conflicts in Petri nets'. Together they form a unique fingerprint.

Cite this