 |
|
|
|
| HAL: hal-00444580, version 1 |
| Detailed view |  Export this paper |
|
|
| Logical Methods in Computer Science 5, 2 (2009) Article 15 |
|
|
|
|
| Explicit Fairness in Testing Semantics |
|
|
| Diletta Cacciagrano 1Flavio Corradini 1 |
|
|
| (2009) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Dipartimento di Matematica e Informatica [Camerino] |
|
|
|
Università degli studi di Camerino |
|
|
| 2: | COMETE (INRIA Saclay - Ile de France) |
|
|
|
INRIA – Polytechnique - X – CNRS : UMR7161 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Computation and Language |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00444580, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00444580 | |
| oai:hal.archives-ouvertes.fr:hal-00444580 | |
| From: Catuscia Palamidessi | |
| Submitted on: Thursday, 7 January 2010 01:05:27 | |
| Updated on: Friday, 8 January 2010 13:58:58 | |
