NDLI: Calculating mean system-failure frequency with prescribed accuracy

Content Provider	IEEE Xplore Digital Library
Author	Schneeweiss, W.G.
Copyright Year	1963
Abstract	To calculate mean system-failure frequency (MSFF) for good engineering designs, an approximation with prescribed accuracy is possible, starting from mincuts, viz, from a sum-of-products form of the fault-tree Boolean-function. Bonferroni-type inequalities, for which a new proof is included, are used. There is a far-reaching similarity between certain kinds of bounds for MSFF (of coherent systems) and for system unavailability. However, this similarity Is not complete. For most real systems, omitting the less-important mincuts yields lower bounds not only for unavailability but also for MSFF. Because an equivalent of the first Bonferroni inequality also holds with MSFF, it is possible to determine an upper bound of the contribution of the deleted mincuts or, the other way around: given a maximum error, determine a set of less-important mincuts, which can be deleted prior to a standard (exact) analysis of the rest. Since 1977 there is a valuable insight that Bonferroni-type inequalities hold also for MSFF (and since 1995 for mean electronic-system life). However, if the difference between the first upper and lower bounds is not small enough, then the investigation of further bounds might be rather cumbersome. However, there is a straight-forward mincut-based approximation to MSFF. As for approximate values of system mean time to failure (MTTF) and mean time to repair (MTTR), upper and lower bounds can be readily found via MSFF=unavailability/MTTR=availability/MTTF using upper and lower bounds for unavailability and MSFF in an obvious way. Of course, these bounds might not be sufficiently tight initially.
Sponsorship	IEEE Reliability Society
Starting Page	201
Ending Page	207
Page Count	7
File Size	440490
File Format	PDF
ISSN	00189529
Volume Number	46
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-06-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Frequency Design engineering Counting circuits Fault trees Upper bound Arithmetic Boolean functions Random processes
Content Type	Text
Resource Type	Article
Subject	Safety, Risk, Reliability and Quality Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximate Fault-Tree Analysis with Prescribed Accuracy

Calculating the Probability of Boolean Expression Being 1

Calculating the Frequency of Boolean Expression Being 1

An intrinsic order criterion to evaluate large, complex fault trees

Directed Graph Techniques for the Analysis of Fault Trees

Fast fault-tree evaluation for many sets of input data

FAMOCUTN and CUTQN: programs for fast analysis of large fault trees with replicated and negated gates

Constructing Fault-Trees by Stepwise Refinement

Bounds on the reliability of binary coherent systems

Calculating mean system-failure frequency with prescribed accuracy

Similar Documents

Approximate Fault-Tree Analysis with Prescribed Accuracy

Calculating the Probability of Boolean Expression Being 1

Calculating the Frequency of Boolean Expression Being 1

An intrinsic order criterion to evaluate large, complex fault trees

Directed Graph Techniques for the Analysis of Fault Trees

Fast fault-tree evaluation for many sets of input data

FAMOCUTN and CUTQN: programs for fast analysis of large fault trees with replicated and negated gates

Constructing Fault-Trees by Stepwise Refinement

Bounds on the reliability of binary coherent systems

Calculating mean system-failure frequency with prescribed accuracy