Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the Ninth Workshop on Quantitative Aspects of Programming Languages, Saarbrücken, Germany, April 1-3, 2011 |
Editors | Mieke Massink, Gethin Norman |
Publisher | Open Publishing Association |
Pages | 61-73 |
Number of pages | 13 |
Volume | 57 |
DOIs | |
Publication status | Published - 4 Jul 2011 |
Event | The 9th Workshop on Quantitative Aspects of Programming Languages, 2011 - Saarbrücken, Germany Duration: 1 Apr 2011 → 3 Apr 2011 Conference number: 9 http://www.dcs.gla.ac.uk/qapl11/ |
Publication series
Name | Electronic Proceedings in Theoretical Computer Science |
---|---|
Publisher | Open Publishing Association |
Volume | 57 |
ISSN (Electronic) | 2075-2180 |
Workshop
Workshop | The 9th Workshop on Quantitative Aspects of Programming Languages, 2011 |
---|---|
Abbreviated title | QAPL 2011 |
Country/Territory | Germany |
City | Saarbrücken |
Period | 1/04/11 → 3/04/11 |
Internet address |