On active redundancy allocation for coherent systems—from the viewpoint of minimal cut decomposition

2018 ◽  
Vol 46 (2) ◽  
pp. 233-239 ◽  
Author(s):  
Rui Fang ◽  
Xiaohu Li
Keyword(s):  
Coherent Systems ◽  
Redundancy Allocation ◽  
Minimal Cut

ACTIVE REDUNDANCY ALLOCATION FOR COHERENT SYSTEMS WITH INDEPENDENT AND HETEROGENEOUS COMPONENTS

2018 ◽  
Vol 34 (1) ◽  
pp. 72-91 ◽  
Author(s):  
Rui Fang ◽  
Xiaohu Li
Keyword(s):  
Sufficient Conditions ◽  
Coherent Systems ◽  
Minimal Path ◽  
Redundancy Allocation ◽  
Numerical Examples ◽  
Minimal Cut Sets ◽  
Minimal Cut ◽  
Minimal Path Sets ◽  
Theoretical Results

This paper studies the allocation of active redundancies to coherent systems on the context that the base and redundancy components have mutual independent lifetimes. For systems with two symmetric components and systems with one component's minimal cut sets (minimal path sets) covering those of another, we derive sufficient conditions to compare the resultant system lifetimes. Some numerical examples are also presented to illustrate the theoretical results.

Active Redundancy Allocation in Coherent Systems

1988 ◽  
Vol 2 (3) ◽  
pp. 343-353 ◽  
Author(s):  
Philip J. Boland ◽  
Emad El Neweihi ◽  
Frank Proschan
Keyword(s):  
Parallel Systems ◽  
Coherent System ◽  
Coherent Systems ◽  
Redundancy Allocation ◽  
Structural Importance ◽  
Component Importance ◽  
Series Systems ◽  
Made In ◽  
Parallel Series

We introduce in this paper a new measure of component importance, called redundancy importance, in coherent systems. It is a measure of importance for the situation in which an active redundancy is to be made in a coherent system. This measure of component importance is compared with both the (Birnbaum) reliability importance and the structural importance of a component in a coherent system. Various models of component redundancy are studied, with particular reference to k/out / of / n systems, parallel-series systems, and series-parallel systems.

Comparing Criticality of Nodes via Minimal Cut (Path) Sets for Coherent Systems

1994 ◽  
Vol 8 (1) ◽  
pp. 79-87 ◽  
Author(s):  
Fan Chin Meng
Keyword(s):  
Importance Measure ◽  
Optimal Assignment ◽  
Coherent Systems ◽  
Minimal Cut ◽  
Importance Ranking

In 1989, Boland, Proschan, and Tong [2] introduced the notion of criticality ranking among nodes and developed a procedure for obtaining an optimal assignment of components in coherent systems. In this article we obtain characterizations of the criticality ranking in terms of minimal cut (path) sets for coherent systems. Furthermore, utilizing the characterizations, it is shown that the criticality ranking defined by Boland et al. [2] is consistent with the cut-importance ranking introduced by Butler in 1979 [4]. A relationship between the criticality ranking and the well-known and widely used Birnbaum reliability importance measure is also derived.

Analysis of minimal path and cut vectors in multistate monotone systems and use it for detection of binary type multistate monotone systems

2020 ◽  
Vol 234 (5) ◽  
pp. 686-695
Author(s):  
Paweł Marcin Kozyra
Keyword(s):  
Coherent Systems ◽  
Minimal Path ◽  
Monotone Systems ◽  
Monotone System ◽  
Minimal Cut

Theorem specifying how all minimal cut (path) vectors to level j can be obtained from all minimal path (cut) vectors to level j in any multistate monotone system is proven. Characterizations of binary type multistate monotone systems and binary type multistate strongly coherent systems by minimal cut and path vectors and corresponding to them, binary type cut and path sets are also demonstrated.

Sign in / Sign up

Export Citation Format

Share Document