ABSTRACT
In our previous work we developed an analytical algorithm which is able to carry out exact reliability quantification of highly reliable systems with maintenance (both preventive and corrective). A directed Acyclic Graph (AG) was used as a system representation. The unavailability of a node of an AG is in fact given by going over all possible combinations of probabilities of the input edges (such combinations that cause failure of the node). New improvement of the computing methodology will be presented in this paper, which efficiently reduces computing time and complexity. The improvement is based on applicable properties of internal non-terminal nodes. If an internal node has multiple-dimensionality, i.e. a lot of input edges, resulting in an excessive summarizing combinations, the number of combinations can be significantly reduced by multiple application of the pivotal decomposition. The effectiveness of the process will be demonstrated on selective systems.
