Infinite trees, markings and well foundedness

  • Ran Rinat
  • Nissim Francez
  • Orna Grumberg
Logic For Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 214)


A necessary and sufficient condition for a given marked tree to have no infinite paths satisfying a given formula is presented. The formulas are taken from a language introduced by Harel, covering a wide scale of properties of infinite paths, including most of the known notions of fairness. This condition underlies a proof rule for proving that a nondeterministic program has no infinite computations satisfying a given formula, interpreted over state sequences. We also show two different forms of seemingly more natural necessary and sufficient conditions to be inadequate.


Atomic Formula Fair Termination Liveness Property Proof Rule Recursive Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AO 83]
    K.R. Apt, E.R. Olderog: "Proof rules and transformations dealing with fairness", SCP 3: 65–100, 1983.Google Scholar
  2. [APS 84]
    K.R. Apt, A. Pnueli, J. Stavi: "Fair termination revisited with delay", TCS 33: 65–84, 1984. Also in: proc. 2nd Conference on foundations of software technology and theoretical computer science (FST-TCS), Bangalore, India, December 1982.Google Scholar
  3. [C 84]
    G. Costa: "A metric characterization of fair CCS", TR CSR-169-84, dept. of comp. sci., Edinburgh university, October 1984.Google Scholar
  4. [DH 85]
    I. Dayan, D. Harel: "Fair termination with cruel schedulers", manuscript, Weizman institute, June 1985.Google Scholar
  5. [DM 84]
    P. Degano, U. Montanati: "Liveness properties as convergence in metric spaces. Proc. of 16th ACM STOC, 1984.Google Scholar
  6. [F 85]
    N. Francez:"Fairness", in press 1985, Springer Verlag, Texts and monographs in computer science series (D. Gries-series editor).Google Scholar
  7. [FK 84]
    N. Francez, D. Kozen: "Generalized fair termination", proc. 11th ACM-POPL, Salt Lake City, January 1984.Google Scholar
  8. [GFK 83]
    O. Grumberg, N. Francez, S. Katz: "A complete proof rule for strong equifairness", proc. 2nd workshop on logics of programs, CMU, June 1983. In: LNCS 164 (E.Clarke, D.Kozen — eds.), Springer Verlag, 1983. To appear in JCSS.Google Scholar
  9. [GFMR 81]
    O. Grumberg, N. Francez, J.A. Makowsky, 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. To appear in Information and Control.Google Scholar
  10. [HA 84]
    D. Harel: "A general result on infinite trees and its applications", proc. 16th ACM-STOC, May 1984.Google Scholar
  11. [LPS 81]
    D. Lehmann, A. Pnueli, J. Stavi: "Impartiality, justice and fairness: the ethics of concurrent termination", proc. 8th ICALP, Acre, Israel, July 1981. In: LNCS 115 (O. Kariv, S. Even — eds.), Springer-Verlag, 1981.Google Scholar
  12. [OA 84]
    E.R. Olderog, K.R. Apt: "Transformations realizing fairness assumptions for parallel programs", TR 84–8, LITP, University of Paris 7, February 1984.Google Scholar
  13. [PN 83]
    A. Pnueli: "On the extremely fair treatment of probabilistic algorithms", proc. 15th ACM-STOC, Boston, April 1983.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Ran Rinat
    • 1
  • Nissim Francez
    • 1
  • Orna Grumberg
    • 1
  1. 1.Department of Computer ScienceTechnion-Israel Institute of TechnologyHaifaIsrael

Personalised recommendations