Abstract
Considering explicit schedulers of nondeterministic programs, we propose a notion of cycles in infinite choice sequences and characterize fair sequences as being composed of cycles. We demonstrate that proof of fairness reduces to showing the existence of such cycles. Guarded commands are used to represent the scheduled actions and a proof technique is presented to discover conspiracies among them.
Cite
CITATION STYLE
Ramanujam, R., & Lodaya, K. (1985). Proving fairness of schedulers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 193 LNCS, pp. 284–301). Springer Verlag. https://doi.org/10.1007/3-540-15648-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
