Explicit fairness in testing semantics

DOI10.2168/LMCS-5(2:15)2009MaRDI QIDQ3636814zbMATH OpenOpenAlexFDO

Authors Diletta Cacciagrano, Catuscia Palamidessi, Flavio Corradini

Publication date 30 June 2009

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0904.2340

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• Fair \(\pi\)
• scientific article; zbMATH DE number 1418454
• Divergence and fair testing
• Applying a testing approach to the calculus of fair ambients
• scientific article; zbMATH DE number 39877

Cited in

(6)

• Abstract fairness and semantics
• Fairness of components in system computations
• Divergence and fair testing
• Applying a testing approach to the calculus of fair ambients
• Fair must testing for I/O automata
• Mixed choice in session types

This page was built for publication: Explicit fairness in testing semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636814)