id: 05571828
dt: j
an: 05571828
au: Corradini, Flavio; Cacciagrano, Diletta; Palamidessi, Catuscia
ti: Explicit fairness in testing semantics.
so: Log. Methods Comput. Sci. 5, No. 2, Paper 15, 27 p., electronic only
    (2009).
py: 2009
pu: Logical Methods in Computer Science c/o Institute of Theoretical Computer
    Science, Technical University of Braunschweig, Braunschweig
la: EN
cc: 
ut: 
ci: 
li: doi:10.2168/LMCS-5(2:15)2009
ab: Summary: 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.
rv: