Real-reward testing for probabilistic processes

DOI10.1016/J.TCS.2013.07.016MaRDI QIDQ2453107zbMATH OpenOpenAlexFDO

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

Publication date 6 June 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.1201

zbMATH Keywords

probabilistic processesfailure simulationsreward testing

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• Real-reward testing for probabilistic processes (extended abstract)
• On real reward testing
• Remarks on testing probabilistic processes
• Testing preorders for probabilistic processes.
• Testing Finitary Probabilistic Processes

Cites work

• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• A probabilistic PDL
• Characterising Testing Preorders for Finite Probabilistic Processes
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• Real-reward testing for probabilistic processes (extended abstract)
• Remarks on testing probabilistic processes
• Scalar Outcomes Suffice for Finitary Probabilistic Testing
• Testing Finitary Probabilistic Processes
• Testing equivalences for processes
• Testing probabilistic automata

Cited in

(7)

• scientific article; zbMATH DE number 7311343 (Why is no real title available?)
• Probabilistic software product lines
• scientific article; zbMATH DE number 3867090 (Why is no real title available?)
• On real reward testing
• Testing probabilistic equivalence through reinforcement learning
• Reward testing equivalences for processes
• Real-reward testing for probabilistic processes (extended abstract)

This page was built for publication: Real-reward testing for probabilistic processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453107)