scientific article; zbMATH DE number 4022992
It is well-known that the key to calculating system reliability lies in finding disjoint S-O-P expressions of the system structure functions. In this paper two general algorithms, the direct Sharp and the recursive Sharp algorithm are developed for this purpose. They are suitable not only for coherent systems but also for non-coherent systems. Especially, the recursive Sharp algorithm has more advantages than the direct Sharp algorithm. It not only has a more rapid computational speed than existing methods have, but also simultaneously obtains disjoint covers of success and failure events of the system, which are useful for calculating the time-specific frequency of system failure. In addition, the recursive Sharp algorithm can yield good approximations of the reliability when the system is so large that computation time becomes prohibitive.
- Recent Developments in Computing of System-Reliability
- A survey of efficient reliability computation using disjoint products approach
- An Algorithm for Symbolic Reliability Computation with Path-sets or Cut-sets
- scientific article; zbMATH DE number 3894810
- Smaller sums of disjoint products by subproduct inversion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765533)