research-article

Open access

On equivalence-completions of fairness assumptions

Authors:

Nissim Francez,

Ralph -J. J. Back,

Reino Kurki-SuonioAuthors Info & Claims

Formal Aspects of Computing, Volume 4, Issue 6

Pages 582 - 591

https://doi.org/10.1007/BF01211476

Published: 01 November 1992 Publication History

PDF eReader

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.

References

[1]

Apt K. R. and Olderog E.-R. Proof Rules and Transformations Dealing with Fairness SCP 1983 3 65-100

Google Scholar

[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 inDistributed Computing.)

Google Scholar

[3]

Apt K. R., Francez N., and Katz S. M. Appraising Fairness in Distributed Languages Distributed Computing 1988 2 226-241

Digital Library

Google Scholar

[4]

Back R.-J. J. and Kurki-Suonio R. Distributed Cooperation with Action Systems TOPLAS 1988 10 4 513-554

Google Scholar

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

Google Scholar

[6]

Francez N. Fairness 1986 New York Springer-Verlag

Google Scholar

[7]

Francez N. Cooperative Proofs for Distributed Programs with Multi-party Interactions IPL 1989 32 235-242

Digital Library

Google Scholar

[8]

Francez, N. and Forman, I. R.:Interacting Processes: a Multiparty Approach to Coordinated Distributed Programming (Forthcoming).

Google Scholar

[9]

Katz S. M. and Peled D. Interleaving Set Temporal Logic TCS 1990 75 263-287

Digital Library

Google Scholar

[10]

Katz, S. M. and Peled, D.: Verification of Distributed Programs using Representative Interleaving Sequences. (To appear inDistributed Computing, 1992.)

Google Scholar

[11]

Lamport L. Time, Clocks and Ordering Events in Distributed Systems Communications of the ACM 1978 21 7 558-565

Digital Library

Google Scholar

[12]

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.

Google Scholar

Cited By

View all

Ochmański EPieckowska J(2007)On Ethics of Mazurkiewicz TracesFundamenta Informaticae10.5555/2367430.236744480:1-3(259-272)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/2367430.2367444
Ochmański EPieckowska J(2007)On Ethics of Mazurkiewicz TracesFundamenta Informaticae10.5555/1366708.136672280:1-3(259-272)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/1366708.1366722
Völzer H(2005)On conspiracies and hyperfairness in distributed computingProceedings of the 19th international conference on Distributed Computing10.1007/11561927_5(33-47)Online publication date: 26-Sep-2005
https://dl.acm.org/doi/10.1007/11561927_5
Show More Cited By

Index Terms

On equivalence-completions of fairness assumptions
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
    2. General programming languages
      1. Language types
2. Theory of computation
  1. Formal languages and automata theory
  2. Semantics and reasoning
    1. Program constructs
    2. Program semantics

Index terms have been assigned to the content through auto-classification.

Recommendations

Airtime Fairness for IEEE 802.11 Multirate Networks

Under a multi rate network scenario, the IEEE 802.11 DCF MAC fails to provide air-time fairness for all competing stations since the protocol is designed for ensuring max-min throughput fairness and the maximum achievable throughput by any station gets ...
A divide & conquer approach to liveness model checking under fairness & anti-fairness assumptions

This paper proposes an approach to making liveness model checking problems under fairness feasible. The proposed method divides such a problem into smaller ones that can be conquered. It is not superior to existing tools dedicated to model checking ...
Model Checking Liveness Properties under Fairness & Anti-fairness Assumptions
APSEC '13: Proceedings of the 2013 20th Asia-Pacific Software Engineering Conference (APSEC) - Volume 01

Model checking liveness properties needs antifairnessas well as fairness assumptions. As a formula expressing fairness assumptions becomes too long to make livenessmodel checking feasible, so does one expressing anti-fairness ones. ABP is used as an ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 4, Issue 6

Nov 1992

97 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 November 1992

Published in FAC Volume 4, Issue 6

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
36
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)2

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ochmański EPieckowska J(2007)On Ethics of Mazurkiewicz TracesFundamenta Informaticae10.5555/2367430.236744480:1-3(259-272)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/2367430.2367444
Ochmański EPieckowska J(2007)On Ethics of Mazurkiewicz TracesFundamenta Informaticae10.5555/1366708.136672280:1-3(259-272)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/1366708.1366722
Völzer H(2005)On conspiracies and hyperfairness in distributed computingProceedings of the 19th international conference on Distributed Computing10.1007/11561927_5(33-47)Online publication date: 26-Sep-2005
https://dl.acm.org/doi/10.1007/11561927_5
Kurki-Suonio R(2003)Action systems in incremental and aspect-oriented modelingDistributed Computing10.1007/s00446-003-0090-z16:2-3(201-217)Online publication date: 1-Sep-2003
https://dl.acm.org/doi/10.1007/s00446-003-0090-z
Völzer H(2002)Refinement-Robust FairnessProceedings of the 13th International Conference on Concurrency Theory10.5555/646737.701937(547-561)Online publication date: 20-Aug-2002
https://dl.acm.org/doi/10.5555/646737.701937
Joung YBurns JMoses Y(1996)On strong-feasibilities of equivalence-completionsProceedings of the fifteenth annual ACM symposium on Principles of distributed computing10.1145/248052.248082(156-165)Online publication date: 1-May-1996
https://dl.acm.org/doi/10.1145/248052.248082

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

References

Cited By

Index Terms

Recommendations

Airtime Fairness for IEEE 802.11 Multirate Networks

A divide & conquer approach to liveness model checking under fairness & anti-fairness assumptions

Model Checking Liveness Properties under Fairness & Anti-fairness Assumptions

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations