Fairness And Priority

Authors:
Pierpaolo Degano;Leonarda Raffoni
Affiliations:
Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 1-56125 Pisa, Italy degano@di.unipi.it;Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 1-56125 Pisa, Italy degano@di.unipi.it
Venue:
Fundamenta Informaticae
Year:
1995

Citing 7
Cited 0

Fairness

Fairness
Weak and strong fairness in CCS

Information and Computation
Fairness, distances and degrees

Theoretical Computer Science
A semantic approach to fairness

Fundamenta Informaticae
A Powerdomain for Countable Non-Determinism (Extended Abstract)

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Processes and a Fair Semantics for the Ada Rendez-Vous

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Liveness properties as convergence in metric spaces

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The random-assignment method for ensuring fairness for non-deterministic and/or concurrent languages is revised in order to make it dependent on the different priorities that each process may have. Priorities affect the choice of the scheduler in that a processes with high priority is preferred to others with a lower priority, still ensuring that all and only fair computations are originated. The actual presentation of the method is based on the non-standard model of the natural numbers of [C70].