TL;DR
This paper explores how fair must testing, under weak fairness assumptions in I/O automata, precisely characterizes the fair preorder on I/O automata as defined by Lynch & Tuttle.
Contribution
It establishes a formal connection between fair must testing and the fair preorder in I/O automata using weak fairness assumptions.
Findings
Fair must testing characterizes the fair preorder on I/O automata.
Weak fairness assumptions are crucial for this characterization.
The result links testing semantics with automata theory concepts.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.