Fairness and conspiracies
References (15)
An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
Theoret. Comput. Sci.
(1983)A complete model for representing the coordination of asynchronous processes
- et al.
Proof rules dealing with fairness
Relational semantics of concurrent programs (with some applications)
- et al.
Some equivalence results on free choice nets and simple nets, and on the periodicity of live free choice nets
A Discipline of Programming
(1976)
There are more references available in the full text version of this article.
Cited by (44)
Generating non-conspiratorial executions
2007, Information Processing LettersLiveness, fairness, and recurrence in Petri nets
1999, Information Processing LettersFairness and control in multi-agent systems
1997, Theoretical Computer ScienceMutex needs fairness
1997, Information Processing LettersStrong fairness and ultra metrics
1992, Theoretical Computer ScienceB-fairness and structural B-fairness in Petri net models of concurrent systems
1992, Journal of Computer and System Sciences
Copyright © 1984 Published by Elsevier B.V.