Diagnosis of Constant Faults in Switching Networks

02/06/2023
by   Mikhail Moshkov, et al.
0

In this paper, we study decision trees for diagnosis of constant faults in switching networks. Each constant fault consists in assigning Boolean constants to some edges of the network instead of literals. The problem of diagnosis is to recognize the function implemented by the switching network with a constant fault from a given set of faults. For this problem solving, we use decision trees. Each query (attribute) of a decision tree consists of observing the value of function implemented by the faulty switching network on a given tuple of variable values. We study the depth of decision trees for diagnosis of arbitrary and specially constructed switching networks and the complexity of diagnostic decision tree construction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2022

Decision trees for regular factorial languages

In this paper, we study arbitrary regular factorial languages over a fin...
research
09/11/2013

Decision Trees for Function Evaluation - Simultaneous Optimization of Worst and Expected Cost

In several applications of automatic diagnosis and active learning a cen...
research
10/21/2019

Extracting local switching fields in permanent magnets using machine learning

Microstructural features play an important role for the quality of perma...
research
12/16/2020

Testing and reconstruction via decision trees

We study sublinear and local computation algorithms for decision trees, ...
research
09/30/2019

Locally Constant Networks

We show how neural models can be used to realize piece-wise constant fun...
research
10/19/2017

Decision Trees for Helpdesk Advisor Graphs

We use decision trees to build a helpdesk agent reference network to fac...

Please sign up or login with your details

Forgot password? Click here to reset