Explicit fairness in testing semantics

Details Explicit fairness in testing semantics Explicit fairness in testing semantics

2009-04-15

arxiv.org/abs/0904.2340v2

LMCS 5 (2:15) 2009

Computer Science

Logic in Computer Science

27 pages, 1 figure, appeared in LMCS

Scientific paper

10.2168/LMCS-5(2:15)2009

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.

Affiliated with

Also associated with

No associations

Rating

Explicit fairness in testing semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Explicit fairness in testing semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit fairness in testing semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-592335