Fair Must Testing for I/O Automata
arXiv:2212.11248 · doi:10.1007/978-3-031-15629-8_30
Abstract
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.
Dedicated to Frits Vaandrager, at the occasion of his 60th birthday