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].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
