Real-reward testing for probabilistic processes
Citation:
Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C., Real-reward testing for probabilistic processes, Theoretical Computer Science, 538, 2013, 16 36Abstract:
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
Sponsor
Grant Number
Science Foundation Ireland (SFI)
SFI 06 IN.1 1898.
Author's Homepage:
http://people.tcd.ie/mcbhenneDescription:
PUBLISHED
Author: HENNESSY, MATTHEW
Type of material:
Journal ArticleSeries/Report no:
Theoretical Computer Science538
Availability:
Full text availableDOI:
http://dx.doi.org/10.1016/j.tcs.2013.07.016Metadata
Show full item recordLicences: