Real-reward testing for probabilistic processes

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

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

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 languageEnglish
Pages (from-to)16-36
Number of pages21
JournalTheoretical Computer Science
Volume538
Early online date24 Jul 2013
DOIs
Publication statusPublished - 12 Jun 2014

Keywords / Materials (for Non-textual outputs)

  • Probabilistic processes
  • Reward testing
  • Failure simulations

Fingerprint

Dive into the research topics of 'Real-reward testing for probabilistic processes'. Together they form a unique fingerprint.

Cite this