@article{cleaveland_dayar_smolka_yuen_1999, title={Testing preorders for probabilistic processes}, volume={154}, ISSN={["1090-2651"]}, DOI={10.1006/inco.1999.2808}, abstractNote={We present a testing preorder for probabilistic processes based on a quantification of the probability with which processes pass tests. The theory enjoys close connections with the classical testing theory of De Nicola and Hennessy in that whenever a process passes a test with probability 1 (respectively some nonzero probability) in our setting, then the process must (respectively may) pass the test in the classical theory. We also develop an alternative characterization of the probabilistic testing preorders that takes the form of a mapping from probabilistic traces to the interval 0, 1], where a probabilistic trace is an alternating sequence of actions and probability distributions over actions. Finally, we give proof techniques, derived from the alternative characterizations, for establishing preorder relationships between probabilistic processes. The utility of these techniques is demonstrated by means of some simple examples.}, number={2}, journal={INFORMATION AND COMPUTATION}, author={Cleaveland, R and Dayar, Z and Smolka, SA and Yuen, S}, year={1999}, month={Nov}, pages={93–148} }