Real-Reward Testing for Probabilistic Processes (Extended Abstract)

Details Real-Reward Testing for Probabilistic Processes (Extended Abstract) Real-Reward Testing for Probabilistic Processes (Extended Abstract)

2011-07-06

arxiv.org/abs/1107.1201v1

EPTCS 57, 2011, pp. 61-73

Computer Science

Logic in Computer Science

In Proceedings QAPL 2011, arXiv:1107.0746

Scientific paper

10.4204/EPTCS.57.5

We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative-reward testing with negative rewards. In this richer testing framework, the may and must preorders turn out to be inverses. We show that for convergent processes with finitely many states and transitions, but not in the presence of divergence, the real-reward must-testing preorder coincides with the nonnegative-reward must-testing preorder. To prove this coincidence we characterise the usual resolution-based testing in terms of the weak transitions of processes, without having to involve policies, adversaries, schedulers, resolutions, or similar structures that are external to the process under investigation. This requires establishing the continuity of our function for calculating testing outcomes.

Affiliated with

Also associated with

No associations

Rating

Real-Reward Testing for Probabilistic Processes (Extended Abstract) 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 Real-Reward Testing for Probabilistic Processes (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Real-Reward Testing for Probabilistic Processes (Extended Abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678826