Testing Finitary Probabilistic Processes
                      (Extended Abstract)

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

We provide both modal- and relational characterisations of may- and
must-testing preorders for recursive CSP processes with divergence,
featuring probabilistic as well as nondeterministic choice. May
testing is characterised in terms of simulation, and must testing in
terms of failure simulation. To this end we develop weak transitions
between probabilistic processes, elaborate their topological properties,
and express divergence in terms of partial distributions.