Dividing a system into almost unidirectional blocks
When a system is divided into blocks B1 B2 .. Bk .. Bm such that the existence of failure in Bk will not interfare required performance of blocks B1 B2 ... and Bk−1, then these blocks are called unidirectional blocks. To determine failure elements in a system, unidirectional blocks B1 B2 ... will be tested one by one in the order to find a block containing failure first, then diagnose the block to locate failure elements. It is easily seen that this process is simpler than testing a system as a whole to determine the location of failure elements by one procedure. Unfortunatley, most of systems can not be divided into unidirectional blocks. However, it is possible to divide a system into almost unidirectional blocks B1 B2 ... Bk ... Bm such that the existence of failure in Bk will interfare only slightly to the performance of preceding blocks B1 B2 ... Bk−1.
- 1.T.N. Trick, W. Mayeda & A.A. Sakla, "Calculation of Parameter Values from Node Voltage Measurements", IEEE Trans on Circuits and Sys., vol. CAS-26, No. 7, pp 446–473, July 1979.Google Scholar
- 2.T.N. Trick, W. Mayeda & A.A. Sakla, "Determination of Component Values From Node Voltage Measurements", Proc. of 1979 ISCAS, pp 878–881, July 1979.Google Scholar
- 3.S. Shinoda, Y. Kajitani, K. Onaga and W. Mayeda, "Various Characterizations of Series-Parallel Graphs", Proc. of 1979 ISCAS, pp 100–103, July 1979.Google Scholar
- 4.W. Mayeda, Graph Theory, John Wiley & Sons, 1972.Google Scholar
- 5.K. Onaga & W. Mayeda, "A Boolean Theory of Network Flows and Matrices to particle Transmission and Clustering", Networks, vol 9 pp 249–281, 1979.Google Scholar