Conformance Testing of Mealy Machines Under Input Restrictions
Alberto Larrauri, Roderick Bloem

TL;DR
This paper presents a grey-box conformance testing method for interconnected Mealy Machines with input restrictions, offering improved fault detection and scalability over existing black-box techniques.
Contribution
It introduces a novel grey-box testing approach that exploits repetitions in composite machines and provides new fault detection conditions.
Findings
Outperforms existing black-box testing methods
Effective on networks with up to a thousand states
Provides new theoretical fault detection conditions
Abstract
We introduce a grey-box conformance testing method for networks of interconnected Mealy Machines. This approach addresses the scenario where all interfaces of the component under test are observable, but its inputs are under the control of other white-box components. We prove new conditions for full fault detection that exploit repetitions across branching executions of the composite machine in a novel way.Finally, we provide experimental evaluation of our approach on cascade compositions of up to a thousand states, and show that it notably out-performs existing black-box testing techniques.
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.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Machine Learning in Materials Science · Ferroelectric and Negative Capacitance Devices
