Best Fairness Hierarchy in Elementary Nets

Authors:
Edward Ochmański
Affiliations:
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Year:
2003

Citing 5
Cited 0

Fairness and conspiracies

Information Processing Letters
Fairness

Fairness
Liveness, fairness, and recurrence in Petri nets

Information Processing Letters
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Elementary Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of marking-fairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞-fairness. This result gives a method of a local control ensuring globally fair executions. Next we show how to check, if a given elementary net is conspiracy-free, and prove the obtained criterion to be effectively decidable. Finally, we give a characterization of live concurrent systems, using the notion of ∞-fairness.