Explicit fairness in testing semantics
Logic in Computer Science
2015-07-01 v2
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.
Keywords
Cite
@article{arxiv.0904.2340,
title = {Explicit fairness in testing semantics},
author = {D. Cacciagrano and F. Corradini and C. Palamidessi},
journal= {arXiv preprint arXiv:0904.2340},
year = {2015}
}
Comments
27 pages, 1 figure, appeared in LMCS