Detecting a single fault in a deterministic finite automaton

06/01/2021
by   Artur Polański, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2019

High-Level Combined Deterministic and Pseudoexhuastive Test Generation for RISC Processors

Recent safety standards set stringent requirements for the target fault ...
research
04/12/2021

SuperSim: a test set for word similarity and relatedness in Swedish

Language models are notoriously difficult to evaluate. We release SuperS...
research
03/27/2013

Bayesian Assessment of a Connectionist Model for Fault Detection

A previous paper [2] showed how to generate a linear discriminant networ...
research
01/30/2020

Non-Determinism in TensorFlow ResNets

We show that the stochasticity in training ResNets for image classificat...
research
03/30/2018

Generation of complete test sets

We use testing to check if a combinational circuit N always evaluates to...
research
01/16/2014

Approximate Model-Based Diagnosis Using Greedy Stochastic Search

We propose a StochAstic Fault diagnosis AlgoRIthm, called SAFARI, which ...
research
08/14/2019

Adabot: Fault-Tolerant Java Decompiler

Reverse Engineering(RE) has been a fundamental task in software engineer...

Please sign up or login with your details

Forgot password? Click here to reset