Introduction to Discrete Structures for Computer Science and Engineering
Introduction to Discrete Structures for Computer Science and Engineering
Use of SPOOF's in the Analysis of Faulty Logic Networks
IEEE Transactions on Computers
Cause-Effect Analysis for Multiple Fault Detection in Combinational Networks
IEEE Transactions on Computers
A Decomposition Method of Determining Maximum Compatibles
IEEE Transactions on Computers
Derivation of maximal compatibles using Boolean algebra
IBM Journal of Research and Development
A Tree Representation of Combinational Networks
IEEE Transactions on Computers
| Hi-index | 14.98 |
A compatibility relationship on network paths is defined in such a way that the maximal compatibles are isomorphic to the products in the "structure and parity-observing output function" (SPOOF), a subscripted Boolean expression for the network output that uniquely specifies the network structure. For a given network, the path compatibility relations are easy to find, as are the maximal compatibles and hence the SPOOF for the network output. Because the collection of all the path compatibility relations, conveniently displayed in matrix form, completely characterizes the network, the compatibility matrix can be used for a variety of purposes.