We consider two characterisations of the may and must testing preorders for a
probabilistic extension of the finite pi-calculus: one based on notions of
probabilistic weak simulations, and the other on a probabilistic extension of a
fragment of Milner-Parrow-Walker modal logic for the pi-calculus. We base our
notions of simulations on the similar concepts used in previous work for
probabilistic CSP.