Fairness and hyperfairness

Distributed Computing

Volumn 13, Issue 4, 2000, Pages 239-245

  Lamport, Leslie ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORMAL LANGUAGES;

FAIRNESS; HYPERFAIRNESS; MACHINE CLOSURE;

FORMAL LOGIC;

EID: 0034316809     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008921     Document Type: Article

References (18)

1. M. Abadi, Leslie Lamport: The existence of refinement mappings. Theor Comput Sci 82(2):253-284 (1991)
2. M. Abadi, L. Lamport: Composing specifications. ACM Trans Program Lang Syst 15(1):73-132 (1993)
3. M. Abadi, L. Lamport: An old-fashioned recipe for real time. ACM Trans Program Lang Syst 16(5):1543-1571 (1994)
4. B. Alpern, F. B. Schneider: Defining liveness. Inform Process Letters, 21(4):181-185 (1985)
5. K. R. Apt, N. Francez, S. Katz: Appraising fairness in languages for distributed programming. Distrib Comput 2:226-241 (1988)
6. P. C. Attie, N. Francez, O. Grumberg: Fairness and hyperfairness in multi-party interactions. Distrib Comput 6(4):245-254 (1993)
7. R. J. R. Back, R. Kurki-Suonio: Decentralization of process nets with centralized control. In: Proceedings of the SEcond Annual ACM Symposium on Principles of Distributed Computing, p 131-142. The Association for Computing Machinery, 1983
8. N. Francez: Fairness. Texts and Monographs in Computer Science. Berlin, Heidelberg, New York: Springer 1986
9. N. Francez, D. Kozen: Generalized fair termination. In: Proceedings of the Eleventh Annual ACM Symposium on Principles of Programming Languages, p. 46-53 (1984)
10. L. Lamport: A simple approach to specifying concurrent systems. Communications of the ACM, 32(1):32-45 (1989)
11. L. Lamport: Win and sin: Predicate transformers for concurrency. ACM Trans Program Lang Syst 12(3):396-428 (1990)
12. L. Lamport: The temporal logic of actions. ACM Trans Program Lang Syst 16(3):872-923 (1994)
13. N. Lynch, M. Tuttle: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth Symposium on the Principles of Distributed Computing, p. 137-151. ACM, August 1987
14. Z. Manna, A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems. New York: Springer 1991
15. J. Misra: Specifying concurrent objects as communicating processes. Sci Comput Program 14(2-3):159-184 (1990)
16. J. P. Queille, J. Sifakis: Fairness and related properties in transition systems-a temporal logic to deal with fairness. Acta Inf 19:195-210 (1983)
17. F. B. Schneider: On Concurrent Programming. Graduate Texts in Computer Science. Berlin, Heidelberg, New York: Springer 1997
18. A. P. Sistla, E. M. Clarke, N. Francez, A. R. Meyer: Can message buffers be axiomatized in linear temporal logic? Information and Control, 63(1/2):88-112, (1984)