Algebraic Properties of Functions Affecting Optimum Fault-Tolerant Realizations

When a specific type of network is required, the function to be realized limits the amount of fault tolerance that can be achieved. Parameters of functions that affect the maximum obtainable fault tolerance and the maximum obtainable diagnosability are investigated for several types of combinational memoryless) networks.

[1]  EDWARD J. McCLUSKEY,et al.  Fault Equivalence in Combinational Logic Networks , 1971, IEEE Transactions on Computers.

[2]  John F. Meyer,et al.  Locatability of Faults in Combinational Networks , 1971, IEEE Transactions on Computers.

[3]  Tunc Geveci,et al.  Advanced Calculus , 2014, Nature.

[4]  Stephen Y. H. Su,et al.  A New Approach to the Fault Location of Combinational Circuits , 1972, IEEE Transactions on Computers.

[5]  R. Tennant.  Algebra , 1941, Nature.

[6]  Zvi Kohavi,et al.  Designing Sets of Fault-Detection Tests ror Combinational Logic Circuits , 1971, IEEE Transactions on Computers.

[7]  SUDHAKAR M. REDDY,et al.  Multiple Fault Detection in Combinational Networks , 1972, IEEE Transactions on Computers.

[8]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[9]  Frederick W. Clegg.  Use of SPOOF's in the Analysis of Faulty Logic Networks , 1973, IEEE Transactions on Computers.

[10]  Zvi Kohavi,et al.  Detection of Multiple Faults in Combinational Logic Networks , 1972, IEEE Transactions on Computers.

[11]  W.G. Bouricius,et al.  Algorithms for Detection of Faults in Logic Circuits , 1971, IEEE Transactions on Computers.