Detecting a single fault in a deterministic finite automaton

TL;DR

This paper presents an algorithm to identify a single fault in a deterministic finite automaton using a specific test set, ensuring fault detection if it exists.

Contribution

It introduces a novel algorithm for fault detection in deterministic finite automata with at most one fault, based on a targeted testing approach.

Findings

Algorithm guarantees detection of a single fault if present.

Test set size is minimized for efficient testing.

Applicable to automata with at most one fault.

Abstract

Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.