Explicit fairness in testing semantics

TL;DR

This paper explores fair computation semantics in the pi-calculus, comparing different fairness notions to understand their expressiveness and discriminating power in testing semantics.

Contribution

It introduces a labeling method for actions to filter unfair computations and compares existing and new fairness notions in pi-calculus testing semantics.

Findings

Fairness notions differ in discriminating power

Labeling actions helps filter unfair computations

Comparison reveals insights into expressiveness of fairness semantics

Abstract

In this paper we investigate fair computations in the pi-calculus. Following Costa and Stirling's approach for CCS-like languages, we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair-testing notion with those that naturally arise by imposing weak and strong fairness. This comparison provides insight about the expressiveness of the various `fair' testing semantics and about their discriminating power.