Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, E.R. Olderog: "Proof rules and transformations dealing with fairness", SCP 3: 65–100, 1983.
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.
G. Costa: "A metric characterization of fair CCS", TR CSR-169-84, dept. of comp. sci., Edinburgh university, October 1984.
I. Dayan, D. Harel: "Fair termination with cruel schedulers", manuscript, Weizman institute, June 1985.
P. Degano, U. Montanati: "Liveness properties as convergence in metric spaces. Proc. of 16th ACM STOC, 1984.
N. Francez:"Fairness", in press 1985, Springer Verlag, Texts and monographs in computer science series (D. Gries-series editor).
N. Francez, D. Kozen: "Generalized fair termination", proc. 11th ACM-POPL, Salt Lake City, January 1984.
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.
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.
D. Harel: "A general result on infinite trees and its applications", proc. 16th ACM-STOC, May 1984.
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.
E.R. Olderog, K.R. Apt: "Transformations realizing fairness assumptions for parallel programs", TR 84–8, LITP, University of Paris 7, February 1984.
A. Pnueli: "On the extremely fair treatment of probabilistic algorithms", proc. 15th ACM-STOC, Boston, April 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Rinat, R., Francez, N., Grumberg, O. (1986). Infinite trees, markings and well foundedness. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022672
Download citation
DOI: https://doi.org/10.1007/BFb0022672
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16443-2
Online ISBN: 978-3-540-39783-0
eBook Packages: Springer Book Archive