论文信息 - Infinite Trees, Markings and Well Foundedness

Infinite Trees, Markings and Well Foundedness

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.

Nissim Francez | Orna Grumberg | Ran Rinat

[1] Willem P. de Roever,et al. A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..

[2] Amir Pnueli,et al. Fair Termination Revisited-With Delay , 1984, Theor. Comput. Sci..

[3] Ernst-Rüdiger Olderog,et al. Transformations Realizing Fairness Assumptions for Parallel Programs , 1984, STACS.

[4] Ernst-Rüdiger Olderog,et al. Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[5] Amir Pnueli,et al. Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[6] Nissim Francez,et al. A Compete Proof Rule for Strong Equifair Termination , 1983, Logic of Programs.

[7] Nissim Francez,et al. Generalized fair termination , 1984, POPL '84.

[8] David Harel,et al. A general result on infinite trees and its applications , 1984, STOC '84.

[9] Gerardo Costa,et al. A Metric Characterization of Fair Computations in CCS , 1985, TAPSOFT, Vol.1.

[10] Ugo Montanari,et al. Liveness properties as convergence in metric spaces , 1984, STOC '84.

[11] Amir Pnueli,et al. On the extremely fair treatment of probabilistic algorithms , 1983, STOC.