IP Library Granted Patent US 11,816,410
Granted Patent B2
US 11,816,410 · App. 17/899,210 · Granted Nov 14, 2023

System and method for formal fault propagation analysis

Inventors: Dominik Strasser (Munich, DE); Jörg Grosse (Munich, DE); Jan Lanik (Munich, DE); Raik Brinkmann (Munich, DE)
Assignee: Siemens Electronic Design Automation Gmbh
G06F30/3323G01R31/2839G01R31/2844G01R31/31835G01R31/318307G01R31/318314G06F9/30098
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,816,410
App. No.
17/899,210
Granted
Nov 14, 2023
Kind
B2
Abstract

A system and method are disclosed for formulating a sequential equivalency problem for fault (non)propagation with minimal circuit logic duplication by leveraging information about the location and nature of a fault. The system and method further apply formal checking to safety diagnoses and efficiently models simple and complex transient faults.

Claims (26)

1. A computer-implemented method for calculation and display of a fault propagation path, the method comprising:

identifying, by a computing device, a fault location of a fault in an electrical circuit;

identifying, by the computing device, an observation point in the electrical circuit in which the fault has propagated from the fault location to the observation point;

computing, by the computing device, a fault path from the fault location to the observation point; and

displaying, in a waveform viewer, all impacted signals in the fault path in an ordered list from the fault location to the observation point in order of their creation.

2. The computer-implemented method of claim 1 , wherein the computing of the fault path comprises computing a shortest path of the impacted signals from the fault location to the observation point.

3. The computer-implemented method of claim 2 , wherein the computing of the shortest path comprises computing the shortest path in terms of a number of signals.

4. The computer-implemented method of claim 2 , wherein the computing of the shortest path comprises computing the shortest path in terms of a number of instances.

5. The computer-implemented method of claim 2 , wherein the computing of the shortest path comprises computing the shortest path in terms of a number of registers.

6. The computer-implemented method of claim 2 , wherein the computing of the shortest path comprises adding a deviation or alteration to the shortest path.

7. The computer-implemented method of claim 1 , wherein the displaying comprises displaying the impacted signals in a timing domain, resulting in a stepladder in a different color in the display to show how a fault moves forward from one signal to a next signal.

8. The computer-implemented method of claim 1 , wherein the displaying comprises using a visual indicator.

9. The computer-implemented method of claim 8 , wherein the visual indicator comprises at least one different color, at least one different line thickness, at least one different type of line, or a combination thereof.

10. The computer-implemented method of claim 1 , wherein the identifying of the observation point comprises identifying a plurality of observation points in the electrical circuit,

wherein the computing of the fault path comprises computing a plurality of fault paths from the fault location to the plurality of observation points, and

wherein the displaying of the impacted signals comprises displaying, for each fault path of the plurality of fault paths, all impacted signals in the fault path from the fault location to the observation point in order of creation, wherein data and graphs for the plurality of observation points are displayed.

11. The computer-implemented method of claim 1 , wherein the computing of the fault path comprises:

(a) entering the observation point in a current signal list;

(b) comparing each signal on the current signal list with an impacted signal list;

(c) for each compared signal on the impacted signal list that is not the fault location, adding fanin signals of the respective signal to a next current signal list and storing the respective signal as a parent of the fanin signals;

(d) making the next current signal list the current signal list and returning to act (b);

(e) setting fault locations at a path signal;

(f) determining if the path signal has a parent signal;

(g) when the path signal has a parent signal, using the parent signal as a new path signal, storing the new path signal in a path list, and returning to act (f) for the new path signal; and

(h) when the path signal does not have a parent signal, outputting the fault path of the impacted signals as a shortest fault path to the waveform viewer.

12. The computer-implemented method of claim 1 , wherein the impacted signals have signal values that are different from signal values present in a golden design.

Assignments (3)
CORRECTIVE ASSIGNMENT TO CORRECT THE CLERICAL ERROR OF ELCETRONIC TO ELECTRONIC PREVIOUSLY RECORDED ON REEL 063581 FRAME 0480. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER AND CHANGE OF NAME . Recorded May 16, 2023
From: ONESPIN SOLUTIONS GMBH
To: SIEMENS ELECTRONIC DESIGN AUTOMATION GMBH
Reel/Frame 063889/0548 →
MERGER AND CHANGE OF NAME Recorded May 9, 2023
From: ONESPIN SOLUTIONS GMBH; SIEMENS ELECTRONIC DESIGN AUTOMATION GMBH
To: SIEMENS ELCETRONIC DESIGN AUTOMATION GMBH
Reel/Frame 063581/0480 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 5, 2022
From: STRASSER, DOMINIK; GROSSE, JÖRG; LANIK, JAN; BRINKMANN, RAIK
To: ONESPIN SOLUTIONS GMBH
Reel/Frame 061318/0494 →
Priority Claims (1)
LU 100321 · Jun 19, 2017 · national
Continuity (3)
Continuation 16620622
Continuation In Part 15626674 · Jun 19, 2017
Related Publication 20220414306A1 · Dec 29, 2022