  The concept of must testing is naturally parametrised with a chosen
completeness criterion or fairness assumption. When taking weak fairness as
used in I/O automata, I show that it characterises exactly the fair preorder on
I/O automata as defined by Lynch & Tuttle.
