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.
翻译:必须测试的概念自然会与选择的完整性标准或公平性假设相匹配。 在采取I/O Automata 所使用的公平性薄弱时,我展示了它精确地说明了Lynch & Tuttle定义的I/O Automata 的公平前置顺序。