Remarks on Testing Probabilistic Processes

Select |




Print


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll; Zhang, Cuicui

Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll; Zhang, Cuicui


2007-04-01


Journal Article


Electronic Notes in Theoretical Computer Science


172


359-397


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.


Probabilistic processes, nondeterminism, CSP, transition systems, testing equivalences, simulation, complete axiomatisations, structural operational semantics.


http://www.cse.unsw.edu.au/~rvg/pub/gdpf.pdf


1571-0661


nicta:145


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll; Zhang, Cuicui. Remarks on Testing Probabilistic Processes. Electronic Notes in Theoretical Computer Science. 2007-04-01; 172:359-397.



Loading citation data...

Citation counts
(Requires subscription to view)