Quantitative testing semantics for non-interleaving

Details Quantitative testing semantics for non-interleaving Quantitative testing semantics for non-interleaving

2009-06-22

arxiv.org/abs/0906.3994v1

Computer Science

Logic in Computer Science

Scientific paper

This paper presents a non-interleaving denotational semantics for the ?-calculus. The basic idea is to define a notion of test where the outcome is not only whether a given process passes a given test, but also in how many different ways it can pass it. More abstractly, the set of possible outcomes for tests forms a semiring, and the set of process interpretations appears as a module over this semiring, in which basic syntactic constructs are affine operators. This notion of test leads to a trace semantics in which traces are partial orders, in the style of Mazurkiewicz traces, extended with readiness information. Our construction has standard may- and must-testing as special cases.

Affiliated with

Also associated with

No associations

Rating

Quantitative testing semantics for non-interleaving 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 Quantitative testing semantics for non-interleaving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantitative testing semantics for non-interleaving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495417