Abstract A fault tree data array converts the logic of a fault tree into software by using a data base technique. Each array element of a data array contains a decision or termination of the fault tree, and a relative exponential addressing expression provides the data elements with a unique position in the array. The next position in the data array to be examined is calculated by the relative exponential addressing expressions. For unsymmetrical fault trees on additional data array is generated to provide a sequential list of tests to be examined until a fault is found. Then the relative exponential addressing technique is used. The result is a more compact method of storing data in computer memory, hence providing an efficient method for implementing fault trees into software.
Inventors
👤 William R. Russell
👤 executor Samuel G. Russell
Bibliographic Details
Application Number—
JurisdictionUS
Data Sourcegoogle_patents
Last Synchronized2026-10-26 09:48
CPC Classifications
G; G06; G06F; G06F11/00
Claims Analysis
Total Claims: 2
Claim 1
Independent Claim
103 words
A method for use in computer controlled detection and indication of a malfunction in a system, said method comprising the steps of: providing a plural level fault tree wherein alternative true and false decisions are arranged as information nodes of a data array to be examined in a sequence to lead to a conclusion; examining nodes in a predetermined first path for true (T) or false (F) status; examining subsequent nodes in accordance with the expressions A(T).sub.n+1 =A.sub.n +2.sup.L for true results A(F).sub.n+1 =A.sub.n +2(2.sup.L) for false results where A=node number, L=tree level, and n=present node being examined, until a conclusion is reached.
Claim 2
Independent Claim
103 words
A method for use in computer controlled detection and indication of a malfunction in a system, said method comprising the steps of: providing a plural level fault tree wherein alternative true and false decisions are arranged as information nodes of a data array to be examined in a sequence to lead to a conclusion; examining nodes in a predetermined first path for true (T) or false (F) status; examining subsequent nodes in accordance with the expressions A(T).sub.n+1 =A.sub.n +2.sup.L for true results A(F).sub.n+1 =A.sub.n +2(2.sup.L) for false results where A=node number, L=tree level, and n=present node being examined, until a conclusion is reached.