Trustworthy Systems

Real reward testing for probabilistic processes (extended abstract)


Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan

Shanghai Jiao Tong University



Trinity College Dublin


We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative reward testing with negative rewards. In this 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 involving 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.

BibTeX Entry

    address          = {Saarbr\"ucken, Germany},
    author           = {Deng, Yuxin and van Glabbeek, Robert and Hennessy, Matthew and Morgan, Carroll},
    booktitle        = {Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011)},
    doi              = {10.4204/EPTCS.57.5},
    editor           = {{Mieke Massink \& Gethin Norman}},
    keywords         = {probabilistic processes, nondeterminism, transition systems, testing equivalences, reward testing,
                        failure simulation, divergence.},
    month            = jul,
    pages            = {61--73},
    paperurl         = {},
    publisher        = {Open Publishing Association},
    title            = {Real Reward Testing for Probabilistic Processes (Extended Abstract)},
    year             = {2011}