Fair Must Testing for I/O Automata

12/21/2022

∙

by   Rob van Glabbeek, et al.

∙

0

∙

share

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.