← Back to Patent Explorer
US5548715A Expired / Lapsed US ⏱️ 0.0 years remaining

Analysis of untestable faults using discrete node sets

Assignee: Cadence Design Systems Inc
•
Filing: 1994-06-10
•
Granted: 1996-08-20
•
Expires: 2014-06-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract This invention teaches a system (10) and method for analyzing a fault within a model of a logic circuit. The method includes the computer executed steps of (a) building a fault model of the circuit model; (b) for each modelled fault that is determined to be untestable, (b) building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and (c) outputting the discrete node set for analysis. The step of building a fault model includes a step of classifying the untestable faults into at least three categories including unobservable faults, excitation conflict faults, and reverse and forward implication (RFI) conflict faults. Faults from each of these three classifications are processed differently so as to build a relevant discrete node set for subsequent analysis.

Inventors

  • 👤 William B. Maloney
  • 👤 Robert M. Mesnard
  • 👤 Joseph M. Swenton

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 00:28
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/3183; G01R31/318342

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 271 words
A method for analyzing a fault within a model of a logic circuit, comprising the computer executed steps of: building a fault model of the circuit model; for each modelled fault that is determined to be untestable, building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and outputting the discrete node set for analysis; wherein for a fault classified as an unobservable fault, the step of building the discrete node set includes the steps of: identifying all terminal nodes associated with the unobservable fault; starting at the site of the unobservable fault, adding to the discrete node set all nodes occurring on paths to the identified terminal nodes; determining if any terminal nodes exist due to blocking signals and, if no, executing the step of outputting the discrete node set for analysis, else, if yes, identifying all origins for the blocking signals; starting at the terminal nodes, adding to the discrete node set all nodes occurring on paths from the identified blocking signal origins; starting at the determined blocking signal origins that are circuit objectives required for exciting the unobservable fault, adding to the discrete node set all nodes, occurring on paths to the site of the unobservable fault, that contain signals required for exciting the unobservable fault; and starting at blocking signal origins that are circuit objectives required for propagating the unobservable fault, adding to the discrete node set all nodes that occur on paths to the fault propagation paths and which contain signals required for fault propagation; and executing the step of outputting the discrete node set for analysis.
Claim 2
Independent Claim 271 words
A method for analyzing a fault within a model of a logic circuit, comprising the computer executed steps of: building a fault model of the circuit model; for each modelled fault that is determined to be untestable, building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and outputting the discrete node set for analysis; wherein for a fault classified as an unobservable fault, the step of building the discrete node set includes the steps of: identifying all terminal nodes associated with the unobservable fault; starting at the site of the unobservable fault, adding to the discrete node set all nodes occurring on paths to the identified terminal nodes; determining if any terminal nodes exist due to blocking signals and, if no, executing the step of outputting the discrete node set for analysis, else, if yes, identifying all origins for the blocking signals; starting at the terminal nodes, adding to the discrete node set all nodes occurring on paths from the identified blocking signal origins; starting at the determined blocking signal origins that are circuit objectives required for exciting the unobservable fault, adding to the discrete node set all nodes, occurring on paths to the site of the unobservable fault, that contain signals required for exciting the unobservable fault; and starting at blocking signal origins that are circuit objectives required for propagating the unobservable fault, adding to the discrete node set all nodes that occur on paths to the fault propagation paths and which contain signals required for fault propagation; and executing the step of outputting the discrete node set for analysis.
Claim 3
Independent Claim 231 words
A method for analyzing a fault within a model of a logic circuit, comprising the computer executed steps of: building a fault model of the circuit model; for each modelled fault that is determined to be untestable, building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and outputting the discrete node set for analysis; wherein for a fault classified as an excitation conflict fault, the step of building the discrete node set includes the steps of: designating two nodes participating in the excitation conflict as a conflicting node and as a requesting node; establishing a circuit state which sets the conflicting node to a value that is consistent with the requesting node; starting at the conflicting node, adding to the discrete node set all nodes that occur on paths to the site of the excitation conflict fault and which contain signals conflicting with those required for fault excitation at the conflicting node; starting at the requesting node, adding to the discrete node set all nodes that occur on paths to the site of the excitation conflict fault and which contain signals consistent with signals required for fault excitation; starting at the conflicting node, adding to the discrete node set all nodes that occur on paths to the requesting node; and executing the step of outputting the discrete node set for analysis.
Claim 4
Independent Claim 231 words
A method for analyzing a fault within a model of a logic circuit, comprising the computer executed steps of: building a fault model of the circuit model; for each modelled fault that is determined to be untestable, building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and outputting the discrete node set for analysis; wherein for a fault classified as an excitation conflict fault, the step of building the discrete node set includes the steps of: designating two nodes participating in the excitation conflict as a conflicting node and as a requesting node; establishing a circuit state which sets the conflicting node to a value that is consistent with the requesting node; starting at the conflicting node, adding to the discrete node set all nodes that occur on paths to the site of the excitation conflict fault and which contain signals conflicting with those required for fault excitation at the conflicting node; starting at the requesting node, adding to the discrete node set all nodes that occur on paths to the site of the excitation conflict fault and which contain signals consistent with signals required for fault excitation; starting at the conflicting node, adding to the discrete node set all nodes that occur on paths to the requesting node; and executing the step of outputting the discrete node set for analysis.
Claim 5
Independent Claim 392 words
A method for analyzing a fault within a model of a logic circuit, comprising the computer executed steps of: building a fault model of the circuit model; for each modelled fault that is determined to be untestable, building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and outputting the discrete node set for analysis; wherein for a fault classified as an RFI conflict fault, the step of building the discrete node set includes the steps of: identifying all inconsistent circuit objectives and removing the identified inconsistent circuit objectives from a list of circuit objectives, thereby pruning the list of circuit objectives; using an RFI function, establishing a consistent circuit state from the pruned list of circuit objectives, whereby circuit nodes specified by inconsistent circuit objectives will carry signal values contrary to the circuit objective; and for each inconsistent circuit objective, performing the steps of, identifying all origins for contrary signal values on inconsistent nodes; starting at origin nodes of the contrary signal values, adding to the discrete node set all nodes that occur on paths to the inconsistent node, and which contain controlling signals; starting at an inconsistent circuit objective required for exciting the RFI conflict fault, adding to the discrete node set all nodes that occur on paths to the site of the RFI conflict fault, and which contain signals contrary to exciting the RFI conflict fault; starting at an inconsistent circuit objective required for propagation of the RFI conflict fault, adding to the discrete node set all nodes that occur on paths to propagation paths of the RFI conflict fault, and which contain signals contrary to fault propagation; for each origin of contrary signals that are also circuit objectives, defining a relationship between that objective and the RFI conflict fault and: if the circuit objective is due to fault excitation requirements, adding to the discrete node set all nodes (including the origin) that occur on paths to the fault site and that contain signals required for fault excitation; else, if the circuit objective is due to fault propagation requirements, adding to the discrete node set all nodes (including the origin) that occur on paths to the fault propagation path and that contain signals required for propagating the fault; and executing the step of outputting the discrete node set for analysis.
Claim 6
Independent Claim 392 words
A method for analyzing a fault within a model of a logic circuit, comprising the computer executed steps of: building a fault model of the circuit model; for each modelled fault that is determined to be untestable, building a discrete node set comprised of nodes of the circuit model that are relevant to the untestable fault; and outputting the discrete node set for analysis; wherein for a fault classified as an RFI conflict fault, the step of building the discrete node set includes the steps of: identifying all inconsistent circuit objectives and removing the identified inconsistent circuit objectives from a list of circuit objectives, thereby pruning the list of circuit objectives; using an RFI function, establishing a consistent circuit state from the pruned list of circuit objectives, whereby circuit nodes specified by inconsistent circuit objectives will carry signal values contrary to the circuit objective; and for each inconsistent circuit objective, performing the steps of, identifying all origins for contrary signal values on inconsistent nodes; starting at origin nodes of the contrary signal values, adding to the discrete node set all nodes that occur on paths to the inconsistent node, and which contain controlling signals; starting at an inconsistent circuit objective required for exciting the RFI conflict fault, adding to the discrete node set all nodes that occur on paths to the site of the RFI conflict fault, and which contain signals contrary to exciting the RFI conflict fault; starting at an inconsistent circuit objective required for propagation of the RFI conflict fault, adding to the discrete node set all nodes that occur on paths to propagation paths of the RFI conflict fault, and which contain signals contrary to fault propagation; for each origin of contrary signals that are also circuit objectives, defining a relationship between that objective and the RFI conflict fault and: if the circuit objective is due to fault excitation requirements, adding to the discrete node set all nodes (including the origin) that occur on paths to the fault site and that contain signals required for fault excitation; else, if the circuit objective is due to fault propagation requirements, adding to the discrete node set all nodes (including the origin) that occur on paths to the fault propagation path and that contain signals required for propagating the fault; and executing the step of outputting the discrete node set for analysis.

References Cited (Backward Citations)

US3775598A Cited
US4204633A Cited
US4551815A Cited
US4967347A Cited
US5184308A Cited
US5241645A Cited
CA2047439A1 Cited
US5224102A Cited
US5251159A Cited
US5291495A Cited
CA2092880A1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-08-20 2000-02-19 2000-08-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-08-20 2004-02-19 2004-08-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-08-20 2008-02-19 2008-08-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag