Progress, Justness and Fairness

Abstract

Fairness assumptions are a valuable tool when reasoning about systems. In this paper, we classify several fairness properties found in the literature and argue that most of them are too restrictive for many applications. As an alternative we introduce the concept of justness.

References in corpus (4)

• A Process Algebra for Wireless Mesh Networks
• CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Analysing Mutual Exclusion using Process Algebra with Signals
• Progress, Fairness and Justness in Process Algebra

Cited by in corpus (11)

• Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness
• Ensuring Liveness Properties of Distributed Systems: Open Problems
• Reactive Bisimulation Semantics for a Process Algebra with Time-Outs
• Justness: A Completeness Criterion for Capturing Liveness Properties
• Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
• Reactive Temporal Logic
• A Lean-Congruence Format for EP-Bisimilarity
• Correct Black-Box Monitors for Distributed Deadlock Detection: Formalisation and Implementation (Technical Report)
• On Asynchronous Multiparty Session Types for Federated Learning
• Modelling Mutual Exclusion in a Process Algebra with Time-outs
• Fair Must Testing for I/O Automata