Explicit Fairness in Testing Semantics - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2009

Explicit Fairness in Testing Semantics

Abstract

In this paper we investigate fair computations in the $\pi$-calculus \cite{MPW92}. Following Costa and Stirling's approach for CCS-like languages \cite{CS84,CS87}, we consider a method to label process actions in order to filter out unfair computations. We contrast the existing fair-testing notion \cite{RV07,NC95} 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.
Fichier principal
Vignette du fichier
fairpi-LMCS-IIIsubm.pdf (271.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00444580 , version 1 (07-01-2010)

Identifiers

  • HAL Id : hal-00444580 , version 1

Cite

Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi. Explicit Fairness in Testing Semantics. Logical Methods in Computer Science, 2009, 5 (2), pp.Article 15. ⟨hal-00444580⟩
248 View
163 Download

Share

Gmail Facebook X LinkedIn More