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

@inproceedings{Deng2011RealRewardTF, title={Real-Reward Testing for Probabilistic Processes (Extended Abstract)}, author={Yuxin Deng and Rob J. van Glabbeek and Matthew C. B. Hennessy and Carroll Morgan}, booktitle={QAPL}, year={2011} }

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 divergenc e, the real-reward must-testing preorder coincides with the nonnegative-reward must-testing preorder. To prove this coincidence we…

## 4 Citations

### Using schedulers to test probabilistic distributed systems

- Computer ScienceFormal Aspects of Computing
- 2012

A formal testing framework to deal with systems that interact with their environment at physically distributed interfaces, called ports, and where choices between different possibilities are probabilistically quantified is studied.

### Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics

- Computer ScienceArXiv
- 2015

The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling reactive systems and reasoning on several types of associated semantics, in a uniform fashion, by deriving a suite of corresponding verification algorithms suitable for implementation in automated tools.

### Brzozowski's and Up-To Algorithms for Must Testing

- Computer ScienceAPLAS
- 2013

This paper proposes to adapt algorithms for language equivalence to check one prime equivalence in concurrency theory, must testing semantics to achieve the transfer of technology from language to must semantics, and takes a coalgebraic outlook at the problem.

## References

SHOWING 1-10 OF 18 REFERENCES

### Scalar Outcomes Suffice for Finitary Probabilistic Testing

- MathematicsESOP
- 2007

It is proved that vectors of real-valued outcomes are unnecessary when processes are finitary, that is finitely branching and finite-state: single scalar outcomes are just as powerful.

### Testing and Refinement for Nondeterministic and Probabilistic Processes

- Computer ScienceFTRTFT
- 1994

The main contribution is a notion of reward testing, and a denotational characterization of a testing preorder that corresponds to a natural probabilistic extension of the trace model.

### The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves

- Computer Science
- 1993

This paper provides a parameterized deenition of a such a preorder, such that most such pre-orders and equivalences found in the literature are obtained by a suitable instantiation of the parameters.

### The Linear Time - Branching Time Spectrum II

- Computer ScienceCONCUR
- 1993

This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time…

### Testing Finitary Probabilistic Processes

- Computer ScienceCONCUR
- 2009

Weak transitions between probabilistic processes are developed, elaborate their topological properties, and express divergence in terms of partial distributions, to develop may- and must-testing preorders for recursive CSP processes with divergence.

### Characterising Testing Preorders for Finite Probabilistic Processes

- Computer Science22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
- 2007

This paper characterises the may- and must preorders in terms of simulation, and the must preorder in terms-of-failure simulation, also gives a characterisation of both preorders using a modal logic and axiomatises both pre orders over a probabilistic version of CSP.

### Testing Probabilistic Automata

- Computer ScienceCONCUR
- 1996

This work studies testing preorders for probabilistic automata in terms of relations that are based on inclusion of trace and failure distributions, i.e., probability distributions over failures and traces that can arise in a Probabilistic computation.

### A probabilistic PDL

- MathematicsJ. Comput. Syst. Sci.
- 1985

A probabilistic analog PPDL of Propositional Dynamic Logic is given and a small model property is proved and a polynomial space decision procedure for formulas involving well-structured programs is given.

### Markov Decision Processes: Discrete Stochastic Dynamic Programming

- Computer ScienceWiley Series in Probability and Statistics
- 1994

Markov Decision Processes covers recent research advances in such areas as countable state space models with average reward criterion, constrained models, and models with risk sensitive optimality criteria, and explores several topics that have received little or no attention in other books.