The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 21, 2012
Filed:
Jun. 29, 2009
Dazhi Wang, San Jose, CA (US);
Kishor S. Trivedi, Durham, NC (US);
Tilak C. Sharma, Tacoma, WA (US);
Anapathur V. Ramesh, Bothell, WA (US);
David William Twigg, Federal Way, WA (US);
Le P. Nguyen, Renton, WA (US);
Yun Liu, Lynnwood, WA (US);
Dazhi Wang, San Jose, CA (US);
Kishor S. Trivedi, Durham, NC (US);
Tilak C. Sharma, Tacoma, WA (US);
Anapathur V. Ramesh, Bothell, WA (US);
David William Twigg, Federal Way, WA (US);
Le P. Nguyen, Renton, WA (US);
Yun Liu, Lynnwood, WA (US);
The Boeing Company, Chicago, IL (US);
Abstract
A computer-based method for determining a probability that no path exists from a specified starting node to a specified target node within a network of nodes and directional links between pairs of nodes is described. The nodes and directional links form paths of a reliability graph and the method is performed using a computer coupled to a database that includes data relating to the nodes and the directional links The method includes selecting a set of paths, from the set of all paths, between the starting node and the target node that have been determined to be reliable, calculating a reliability of the union of the selected path sets, setting an upper bound for the unreliability of the set of all paths, based on the calculated reliability, selecting a set of minimal cutsets from all such cutsets that lie between the starting node and the target node, calculating the probability of the union of the minimal cutsets, and setting a lower bound for the unreliability of the set of all cutsets.