Remarks on Testing Probabilistic Processes

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
2007 Electronical Notes in Theoretical Computer Science  
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
more » ... 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.
doi:10.1016/j.entcs.2007.02.013 fatcat:7ffmnzj7jfe6xcadstjovvb5kq