Remarks on Testing Probabilistic Processes

Download files
Access & Terms of Use
open access
Abstract
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the process calculus CSP. We examine the algebraic theory of probabilistic testing, and show that many of the axioms of standard testing are no longer valid in our probabilistic setting; even for non-probabilistic CSP processes, the distinguishing power of probabilistic tests is much greater than that of standard tests. We develop a method for deriving inequations valid in probabilistic may testing based on a probabilistic extension of the notion of simulation. Using this, we obtain a complete axiomatisation for non-probabilistic processes subject to probabilistic may testing. © 2007 Elsevier B.V. All rights reserved.
Persistent link to this record
DOI
Additional Link
Author(s)
Morgan, Charles
Zhang, Chenyi
Deng, Yuxin
van Glabbeek, Robert
Hennessy, M
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2007
Resource Type
Journal Article
Degree Type
UNSW Faculty
Files
download 0200700356_gdpf.pdf 431.13 KB Adobe Portable Document Format
Related dataset(s)