The notion of completion has been proposed by Francez et al. to transform a non-equivalence-robust fairness notion to an equivalence-robust one while maintaining several properties of the source. However, a completion may not preserve strong-feasibility|a necessary and suucient condition for a completion to be imple-mentable. In this paper, we study the system requirement for a completion to be...

Model checking of liveness properties often results in unrealistic, unfair infinite behaviors as counterexamples. Fairness is a notion where the search is constrained to infinite paths that do not ignore infinitely the execution of a set of enabled actions. In this work we present an implementation for efficient checking of LTL formulas under strong and weak fairness in ProB, available for mode...

This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 specifications. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by...

In this contribution we give a general de nition of fairness and show how this can achieve various fairness de nitions such as those mentioned in the ATM Forum TM Speci cations We discuss how a pricing policy can be mapped to general fairness The general fairness can be achieved by calculating the ExcessFairshare for each VC We show how a switch algorithm can be modi ed to support the general f...

Calders and Verwer’s two-naive-Bayes is one of fairness-aware classifiers, which classify objects while excluding the influence of a specific information. We analyze why this classifier achieves very high level of the fairness, and show that this is due to a decision rules and a model bias. Based on these findings, we develop methods that are grounded on rigid theory and are applicable to wider...

This is the second part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via multiparty interactions. We focus here on equivalence-robust fairness notions where equivalence computations are either all fair or all unfair. Francez et al. (1992, Formal Aspects Comput. 4, 582–591) propose a notion of comple...