US3702011A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for simulating logic faults
Assignee: AT&T Inc
•
Filing: 1970-05-12
•
Granted: 1972-10-31
•
Expires: 1990-05-12
Abstract
Abstract Apparatus and method for simulating logic circuit faults. The logic circuit to be simulated is divided into blocks and digital representations of the interconnections in each block are stored in data tables in the digital computer performing the simulation. Each block is dynamically simulated by computing both the errorfree outputs and the faulty outputs that would be generated by the block in response to the proper inputs to the block. The result of the simulation is a list of system faults which may be transformed into a fault dictionary comprising a list of each possible trouble symptom and the set of faults that produce it.
Inventors
- 👤 Douglas Byron Armstrong
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 15:15
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/32; G06F30/33; G06F11/00; G06F11/22; G06F11/26; G06F11/261
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
110 words
An automated process of constructing an output fault list for digital circuitry including at least one pair of cascaded logic elements, said process comprising the use of a programmed digital computer having stored in its internal memory a program enabling the computer to periodically perform the following steps: determining the particular logic elements having inputs or input fault lists that changed during the preceding computation; and computing for each of said particular logic elements the errorfree output and a list of all faults on the input fault lists of that particular element and all possible internal faults of that particular element which alter the output of that particular logic element.
Claim 2
Dependent Claim
110 words
An automated process of constructing an output fault list for digital circuitry including at least one pair of cascaded logic elements, said process comprising the use of a programmed digital computer having stored in its internal memory a program enabling the computer to periodically perform the following steps: determining the particular logic elements having inputs or input fault lists that changed during the preceding computation; and computing for each of said particular logic elements the errorfree output and a list of all faults on the input fault lists of that particular element and all possible internal faults of that particular element which alter the output of that particular logic element.
Claim 3
Dependent Claim
170 words
An automated process of computing lists of fault conditions that can be detected in a logic circuit containing a plurality of cascaded logic elements, said process comprising the use of a programmed digital computer having stored in its interval memory a program enAbling the computer to perform at periodic intervals the following steps: computing a list of active logic elements, that is, those logic elements having inputs or input fault lists that changed during the preceding interval; computing the error-free output of each active logic element; computing for each particular active logic element a first list of only those fault conditions on the input fault lists of said particular element capable of propagating through said particular element, thereby causing the output signal of said particular element to be complemented; computing a second list of those fault conditions occurring within said particular active logic element that cause said output signal to be complemented; and combining said first and second lists to form the output fault list of said particular logic element.
Claim 4
Dependent Claim
170 words
An automated process of computing lists of fault conditions that can be detected in a logic circuit containing a plurality of cascaded logic elements, said process comprising the use of a programmed digital computer having stored in its interval memory a program enAbling the computer to perform at periodic intervals the following steps: computing a list of active logic elements, that is, those logic elements having inputs or input fault lists that changed during the preceding interval; computing the error-free output of each active logic element; computing for each particular active logic element a first list of only those fault conditions on the input fault lists of said particular element capable of propagating through said particular element, thereby causing the output signal of said particular element to be complemented; computing a second list of those fault conditions occurring within said particular active logic element that cause said output signal to be complemented; and combining said first and second lists to form the output fault list of said particular logic element.
Claim 5
Dependent Claim
29 words
The machine process of claim 2 further comprising the automated step of; flagging each logic element having as an input the output of one of said active logic elements.
Claim 6
Dependent Claim
161 words
The automated process of claim 2 wherein said step of computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a NOR gate or an OR gate, the automated steps of: forming the mathematical set intersection, I, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 1; forming the mathematical set union, U, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 0; setting said list of fault conditions equal to the mathematical set difference I-U if any of said inputs to said particular logic element have an error-free logic value of 1; and setting said list of fault conditions equal to said set union U if all of said inputs to said particular logic element have an error-free logic value of 0.
Claim 7
Dependent Claim
160 words
The automated process of claim 2 wherein said step of computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a NAND or an AND gate, the automated steps of: forming the mathematical set intersection, I, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 0; forming the mathematical set union, U, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 1; setting said list of fault conditions equal to the mathematical set difference I-U if any of said inputs to said particular logic element have an error-free logic value of 0; and setting said list of fault conditions equal to said set union U if all of said inputs to said particular logic element have an error-free logic value of 1.
Claim 8
Dependent Claim
315 words
The automated process of claim 2 wherein said step of computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a NOR gate or an OR gate, the automated steps of: determining whether said particular logic element is a reconverging fan-out element; performing the following four steps if said particular logic element is a reconverging fan-out element: forming the mathematical set intersection, I, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 1, forming the mathematical set union, U, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 0, setting said list of fault conditions equal to the mathematical set difference I-U if any of said inputs to said particular logic element have an error-free logic value of 1, and setting said list of fault conditions equal to said set union U if all of said inputs to said particular logic element have an error-free logic value of 0; and performing the following three steps if said particular logic element is not a reconverging fan-out element: setting said list of fault conditions equal to the mathematical set union of the fault lists on all inputs to said particular logic element if the error-free logic values on all said inputs are 0; setting said list of fault conditions equal to the fault list on the input to said particular logic element that has an error-free logic value of 1 if only one of the inputs to said particular logic element has an error-free logic value of 1; and setting said list of fault conditions equal to the null set if more than one of the inputs to said particular logic element has an error-free logic value of 1.
Claim 9
Dependent Claim
162 words
The machine process of claim 2 wherein said step of computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a flip-flop, the machine steps of: determining the current error-free output logic values of said flip-flop; determining the current input and output fault lists of said flip-flop; determining the new error-free input logic values that are to be applied to said flip-flop; accessing a table having information such as that shown in FIGS. 3D and 3E, by using said current output logic values and said new input logic values, to determine the relationship between said current input and output fault lists and the new output fault lists that will result from the application of said new error-free input logic values to said flip-flop; and using said current input and output fault lists to compute said new output fault lists in accordance with said relationship.
Claim 10
Dependent Claim
315 words
The automated process of claim 2 wherein said step of computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a NAND gate or an AND gate, the automated steps of: determining whether said particular logic element is a reconverging fan-out element; performing the following four steps if said particular logic element is a reconverging fan-out element: forming the mathematical set intersection, I, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 0, forming the mathematical set union, U, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 1, setting said list of fault conditions equal to the mathematical set difference I-U if any of said inputs to said particular logic element have an error-free logic value of 0, and, setting said list of fault conditions equal to said set union U if all of said inputs to said particular logic element have an error-free logic value of 1; and performing the following three steps if said particular logic element is not a reconverging fan-out element: setting said list of fault conditions equal to the mathematical set union of the fault lists on all inputs to said particular logic element if the error-free logic values on all said inputs are 1; setting said list of fault conditions equal to the fault list on the input to said particular logic element that has an error-free logic value of 0 if only one of the inputs to said particular logic element has an error-free logic value of 0; and setting said list of fault conditions equal to the null set if more than one of the inputs to said particular logic element has an error-free logic value of 0.
Claim 11
Independent Claim
97 words
A system for performing a plurality of periodic computations so as to construct a fault list for digital circuitry including at least one pair of cascaded logic elements, said system comprising: means for determining the particular logic elements having inputs or input fault lists that changed during the preceding computation; and means for computing for each of said particular logic elements the error-free output and a list of all faults on the input fault lists of that particular element and all possible internal faults of that particular element which alter the output of that particular logic element.
Claim 12
Independent Claim
97 words
A system for performing a plurality of periodic computations so as to construct a fault list for digital circuitry including at least one pair of cascaded logic elements, said system comprising: means for determining the particular logic elements having inputs or input fault lists that changed during the preceding computation; and means for computing for each of said particular logic elements the error-free output and a list of all faults on the input fault lists of that particular element and all possible internal faults of that particular element which alter the output of that particular logic element.
Claim 13
Dependent Claim
164 words
Apparatus for performing a plurality of computations at periodic intervals so as to compute lists of fault conditions that can be detected in a logic circuit containing a plurality of cascaded logic elements, said apparatus comprising: means for computing a list of active logic elements, that is, those logic elements having inputs or input fault lists that changed during the preceding interval; means for computing the error-free output of each active logic element; means for computing for each particular active logic element a first list of only those fault conditions on the input fault lists of said particular element capable of propagating through said particular element, thereby causing the output signal of said particular element to be complemented; means for computing a second list of only those fault conditions occurring within said particular active logic element that cause said output signal to be complemented; and means for combining said first and second lists to form the output fault list of said particular logic element.
Claim 14
Dependent Claim
164 words
Apparatus for performing a plurality of computations at periodic intervals so as to compute lists of fault conditions that can be detected in a logic circuit containing a plurality of cascaded logic elements, said apparatus comprising: means for computing a list of active logic elements, that is, those logic elements having inputs or input fault lists that changed during the preceding interval; means for computing the error-free output of each active logic element; means for computing for each particular active logic element a first list of only those fault conditions on the input fault lists of said particular element capable of propagating through said particular element, thereby causing the output signal of said particular element to be complemented; means for computing a second list of only those fault conditions occurring within said particular active logic element that cause said output signal to be complemented; and means for combining said first and second lists to form the output fault list of said particular logic element.
Claim 15
Dependent Claim
26 words
The apparatus of claim 10 further comprising: means for flagging each logic element having as an input the output of one of said active logic elements.
Claim 16
Dependent Claim
164 words
The apparatus of claim 10 wherein said means for computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a NOR gate or an OR gate: means for forming the mathematical set intersection, I, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 1; means for forming the mathematical set union, U, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 0; means for setting said list of fault conditions equal to the mathematical set difference I-U if any of said inputs to said particular logic element have an error-free logic value of 1; and means for setting said list of fault conditions equal to said set union U if all of said inputs to said particular logic element have an error-free logic value of 0.
Claim 17
Dependent Claim
163 words
The apparatus of claim 10 wherein said means for computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a NAND or an AND gate: means for forming the mathematical set intersection, I, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 0; means for forming the mathematical set union, U, of the fault lists on all inputs to said particular logic element that have an error-free logic value of 1; means for setting said list of fault conditions equal to the mathematical set difference I-U if any of said inputs to said particular logic element have an error-free logic value of 0; and means for setting said list of fault conditions equal to said set union U if all of said inputs to said particular logic element have an error-free logic value of 1.
Claim 18
Dependent Claim
167 words
The apparatus of claim 10 wherein said means for computing a first list of only those fault conditions that are capable of propagating through said particular logic element further comprises, in case said particular logic element is a flip-flop: means for determining the current error-free output logic values of said flip-flop; means for determining the current input and output fault lIsts of said flip-flop; means for determining the new error-free input logic values that are to be applied to said flip-flop; means for accessing a table having information such as that shown in FIGS. 3D and 3E, by using said current output logic values and said new input logic values, to determine the relationship between said current input and output fault lists and the new output fault lists that will result from the application of said new error-free input logic values to said flip-flop; and means for using said current input and output fault lists to compute said new output fault lists in accordance with said relationship.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-10-31 | 1976-05-01 | 1976-10-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-10-31 | 1980-05-01 | 1980-10-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-10-31 | 1984-05-01 | 1984-10-31 | $7700.00 | Window Closed / Lapsed |