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.
Cite
@article{arxiv.2212.11248,
title = {Fair Must Testing for I/O Automata},
author = {Rob van Glabbeek},
journal= {arXiv preprint arXiv:2212.11248},
year = {2022}
}
Comments
Dedicated to Frits Vaandrager, at the occasion of his 60th birthday