Title :
A Compilation Technique for Exact System Reliability
Author_Institution :
Texas International Airlines, 10912 Gulf Fwy, #38; Houston, TX 77034.
Abstract :
An algorithm is presented for evaluating exact system reliability without using a Boolean polynomial equation. A Boolean expression is used to define logical system configuration. The Boolean expression is converted to Polish postfix notation. System reliability is computed by converting the postfix notation into a sequence of arithmetic and stack operations. Errors are analyzed to identify a possible rounding or chopping error during floating point calculation for system reliability by digital computer.
Keywords :
Algorithm design and analysis; Arithmetic; Binary trees; Boolean functions; Computer errors; Equations; Error analysis; Fault trees; Polynomials; Reliability theory; Base; Binary tree; Binary-state binary-tree; Error propagation; Fault tree; Minimal state; Polish postfix notation; Postorder traversal; Rounding error; Stack; Tree;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.1981.5221077
