Logic of Programs 1983: Logics of Programs pp 257-278 | Cite as

A complete proof rule for strong equifair termination

  • Orna Grümberg
  • Nissim Francez
  • Shmuel Katz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)


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 phrases

non-determinism fairness equifairness termination ordinals invariant 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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
  2. [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
  3. [D]
    E.W. Dijkstra, A Discipline of Programming, Prentice Hall, Englewood Cliffs, N.J., 1976.Google Scholar
  4. [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
  5. [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
  6. [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
  7. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Orna Grümberg
    • 1
  • Nissim Francez
    • 2
  • Shmuel Katz
    • 1
  1. 1.Dept. of Computer ScienceTechnion — Israel Institute of TechnologyHaifaIsrael
  2. 2.Mathematical Sciences Dept.IBM T. J. Watson Research CenterYorktown Heights

Personalised recommendations