In this paper we consider the notions of global-fairness (G-fairness) and bounded-fairness (B-fairness) for arbitrary Petri nets (PNs). G-fairness in a PN guarantees every transition occurs infinitely often in every valid firing sequence of infinite length. B-fairness guarantees a bound on the number of times a transition in the PN can fire without some transition firing at least once. These pr...

Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At implementation level, the question becomes how to implement the underlying fairness which is assumed to be true at the specification level. In this paper, we study four types of fairness, the so-called w-fairness (wea...

Bekoff [J. Consci. Stud. 8 (2001) 81] argued that mammalian social play is a useful behavioral phenotype on which to concentrate in order to learn more about the evolution of fairness. Here, we build a game theoretical model designed to formalize some of the ideas laid out by Bekoff, and to examine whether 'fair' strategies can in fact be evolutionarily stable. The models we present examine fai...

In modeling a concurrent system, fairness constraints are usually considered at a specific granularity level of the system, leading to many different variants of fairness: transition fairness, object/process fairness, actor fairness, etc. These different notions of fairness can be unified by making explicit their parametrization over the relevant entities in the system as universal quantificati...

Test bias, in contrast to test fairness, is best conceptualized in validity terms amenable to statistical analysis. Evidence of predictive validity may be most salient in many situations. Evaluation of predictive bias is generally operationalized via linear regression. Potthoff (1978) provided an efficient and parsimonious regression bias procedure that allows both simultaneous and separate tes...

This is the first part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via synchronous constructs—usually called multiparty interactions. In this part we present a criterion for fairness notions and show that if a fairness notion violates the criterion, then no deterministic algorithm for scheduling mu...

Fairness is a mathematical abstraction used in the modeling of a wide range of phenomena, including concurrency, scheduling, and probability. In this paper, we study fairness in the context of probabilistic systems, and we introduce probabilistic fairness, a novel notion of fairness that is itself deened in terms of probability. The deenition of probabilistic fairness makes it invariant with re...

Traffic marking is an essential component in any Differentiated Services (DS) architecture. Traffic marking can be done with respect to a single flow or a flow aggregate. In a DS network, traffic marking is typically performed at aggregate levels, rather than on the level of individual flows. The use of aggregation raises a number of concerns, such as fairness concern. When we deal with aggrega...