Generalized fair termination

Authors:
Nissim Francez;Dexter Kozen
Affiliations:
Computer Science Department, Technion-lsrael Institute of Technology, Haifa 32000, Israel;Dept. of Computer Science, Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, N. Y.
Venue:
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1984

Citing 7
Cited 10

Countable nondeterminism and random assignment

Journal of the ACM (JACM)
Fairness

Fairness
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination

Proceedings of the 8th Colloquium on Automata, Languages and Programming
A Compete Proof Rule for Strong Equifair Termination

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
On the extremely fair treatment of probabilistic algorithms

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness

Journal of the ACM (JACM) - The MIT Press scientific computation series
Reasoning about fair concurrent programs

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Modular verification of asynchronous networks

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On &ohgr;-automata and temporal logic

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Progress measures and stack assertions for fair termination

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Modalities for model checking (extended abstract): branching time strikes back

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fair termination of communicating processes

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A general result on infinite trees and its applications

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Fairness and hyperfairness

Distributed Computing
Survey: Linear Temporal Logic Symbolic Model Checking

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a generalization of the known fairness and equifairness notions, called @@@@-fairness, in three versions: unconditional, weak and strong. For each such version, we introduce a proof rule for the @@@@-fair termination induced by it, using well-foundedness and countable ordinals. Each such rule is proved to be sound and semantically complete. We suggest directions for further research.