On equivalence-completions of fairness assumptions-Reference-Cited by-同舟云学术

On equivalence-completions of fairness assumptions

Published:1992-11 Issue:6 Volume:4 Page:582-591
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Francez Nissim¹,Back Ralph -J. J.²,Kurki-Suonio Reino³

Affiliation:

1. Computer Science Department, Technion, Haifa, Israel

2. Computer Science Department, Abo Akademi, Finland

3. Software Systems Laboratory, Tampere University of Technology, Finland

Abstract

Abstract The paper considers the treatment of fairness assumptions which are not equivalence-robust , a central issue in relating interleaving semantics to partial order semantics . A notion of completion 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; and minimal 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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01211476.pdf

Reference12 articles.

1. Proof Rules and Transformations Dealing with Fairness;Apt K. R.;SCP,1983

2. 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 in Distributed Computing .)

3. Appraising fairness in languages for distributed programming

4. Distributed Cooperation with Action Systems;Back R.-J. J.;TOPLAS,1988

5. 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.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generating non-conspiratorial executions;Information Processing Letters;2007-08

2. On Conspiracies and Hyperfairness in Distributed Computing;Lecture Notes in Computer Science;2005

3. Action systems in incremental and aspect-oriented modeling;Distributed Computing;2003-09-01

4. Refinement-Robust Fairness;CONCUR 2002 — Concurrency Theory;2002

5. On Fairness Notions in Distributed Systems;Information and Computation;2001-04