Monotone Boolean approximation
Technical Report
·
OSTI ID:6628888
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 6628888
- Report Number(s):
- SAND-82-2357; ON: DE83004764
- Country of Publication:
- United States
- Language:
- English
Similar Records
Matrix-based approach to uncertainty and sensitivity analysis for fault trees
New Mathematical Derivations Applicable to Safety and Reliability Analysis
Computer-aided Fault Tree Analysis. [FTAP, in FORTRAN for CDC 6600/7600 and IBM 360/370 series computers]
Journal Article
·
Sat Feb 28 23:00:00 EST 1987
· Risk Anal.; (United States)
·
OSTI ID:6147011
New Mathematical Derivations Applicable to Safety and Reliability Analysis
Conference
·
Mon Apr 19 00:00:00 EDT 1999
·
OSTI ID:5835
Computer-aided Fault Tree Analysis. [FTAP, in FORTRAN for CDC 6600/7600 and IBM 360/370 series computers]
Technical Report
·
Tue Aug 01 00:00:00 EDT 1978
·
OSTI ID:6322164