A complete proof rule for strong equifair termination
The notion of equifairness, strengthening the familiar notion of fairness, is introduced as a scheduling policy of non-determinism and concurrency. Under this notion, it is infinitely often the case that the number of selections of each of a family of infinitely-often jointly-enabled processes is equal. A proof rule for proving strong equifair-termination is introduced, applied to examples and shown to be (semantically) complete.
C.R. Categories and subject description[F 3.1] Logics and meanings of programs: specifying and verifying and reasoning about programs
Other keywords and phrasesnon-determinism fairness equifairness termination ordinals invariant
Unable to display preview. Download preview PDF.
- [AO]K.R. Apt and E.R. Olderog, Proof Rules and Transformations Dealing with Fairness, TR 82-47, LITP, University of Paris 7, October 1982. To appear in Science of Computer Programming.Google Scholar
- [APS]K.R. Apt, A. Pnueli and J. Stavi, Fair Termination Revisited with Delay, Proceedings of 2nd conference on foundations of software technology and theoretical computer science (FST-TCS), Bangalore, India, December 1982. Also: TR 82-51, LITP, Univ. of Paris 7, October 1982.Google Scholar
- [D]E.W. Dijkstra, A Discipline of Programming, Prentice Hall, Englewood Cliffs, N.J., 1976.Google Scholar
- [GF]O. Grümberg, N. Francez, A complete proof-rule for (weak) equifairness. IBM T.J. Watson Research Center RC-9634, October 1982 (submitted for publication).Google Scholar
- [GFMR]O. Grümberg, N. Francez, J.A. Makowsky and W.P. de Roever, A Proof Rule for Fair Termination of Guarded Commands, Proc. of the Int. Symp. on Algorithmic Languages, Amsterdam, October 1981, North-Holland, 1981.Google Scholar
- [LPS]D. Lehmann, A. Pnueli and J. Stavi, Impartiality, Justice and Fairness: the Ethics of Concurrent Termination, Proc. ICALP 81, in: Lecture notes in computer science 115 (S. Even, O. Kariv — eds.), Springer 1981.Google Scholar
- [P]D. Park, A Predicate Transformer for Weak Fair Iteration, Proc. 6 IBM Symp. on Math. Foundation of Computer Science, Hakone, Japan, 1981.Google Scholar