Abstract
The paper considers the treatment of fairness assumptions which arenot equivalence-robust, a central issue in relatinginterleaving semantics topartial order semantics. A notion ofcompletion is introduced and studied, and two specific completions are considered:maximal completion, which is easier to implement (shown by a broadcast bus implementation) but guarantees only weak liveness properties of programs using it; andminimal completion, which may be harder to implement but induces stronger liveness properties on programs using it. Some properties of completions are formulated. Finally, the impact of non-equivalence-robustness on compositionality with respect to separate fairness assumptions is considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apt, K. R. and Olderog, E.-R.: Proof Rules and Transformations Dealing with Fairness.SCP, 3, 65–100 (1983).
Attie, P. C., Francez, N. and Grumberg, O.: Fairness and Hyperfairness in Multi-Party Interactions. In:17th ACM-POPL, San-Francisco, CA, 17–19 January, pp. 292–305, 1990. (To appear inDistributed Computing.)
Apt, K. R., Francez, N. and Katz, S. M.: Appraising Fairness in Distributed Languages.Distributed Computing,2, 226–241 (1988).
Back, R.-J. J. and Kurki-Suonio, R.: Distributed Cooperation with Action Systems.TOPLAS, 10(4): 513–554, October 1988.
Back, R.-J. J. and Kurki-Suonio, R.: Serilizability in Distributed Systems with Handshaking. In: T. Lepisto and A. Salomaa, (eds),LNCS 172, pp. 52–56. Springer-Verlag, July 1988.
Francez, N.:Fairness. Springer-Verlag, New York, 1986.
Francez, N.: Cooperative Proofs for Distributed Programs with Multi-party Interactions.IPL,32, 235–242 (1989).
Francez, N. and Forman, I. R.:Interacting Processes: a Multiparty Approach to Coordinated Distributed Programming (Forthcoming).
Katz, S. M. and Peled, D.: Interleaving Set Temporal Logic.TCS, 75, 263–287 (1990).
Katz, S. M. and Peled, D.: Verification of Distributed Programs using Representative Interleaving Sequences. (To appear inDistributed Computing, 1992.)
Lamport, L.: Time, Clocks and Ordering Events in Distributed Systems.Communications of the ACM,21(7), 558–565 (1978).
Reisig, W.: Partial Order Semantics vs. Interleaving Semantics for csp-like Languages and its Impact on Fairness. In:LNCS 172, J. Paredaens (ed), Springer-Verlag, July 1984.
Author information
Authors and Affiliations
Corresponding author
Additional information
Work started during a visit of the first author to the Computer Science Department, Abo Akademi, Finland, July–August 1988, and continued during the first author's stay at MCC in 1989/90.
Rights and permissions
About this article
Cite this article
Francez, N., Back, R.J.J. & Kurki-Suonio, R. On equivalence-completions of fairness assumptions. Formal Aspects of Computing 4, 582–591 (1992). https://doi.org/10.1007/BF01211476
Issue Date:
DOI: https://doi.org/10.1007/BF01211476