Bounds for the availabilities for multistate monotone systems based on decomposition into stochastically independent modules

Abstract

Multistate monotone systems are used to describe technological or biological systems when the system itself and its components can perform at different operationally meaningful levels. This generalizes the binary monotone systems used in standard reliability theory. In this paper we consider the availabilities and unavailabilities of the system in an interval, i.e. the probabilities that the system performs above or below the different levels throughout the whole interval. In complex systems it is often impossible to calculate these availabilities and unavailabilities exactly, but it is possible to construct lower and upper bounds based on the minimal path and cut vectors to the different levels. In this paper we consider systems which allow a modular decomposition. We analyse in depth the relationship between the minimal path an cut vectors for the system, the modules and the organizing structure. We analyse the extent to which the availability bounds are improved by taking advantage of the modular decomposition. This problem was treated also in Butler (1982) and Funnemark and Natvig (1985), but the treatment was based on an inadequate analysis of the relationship between the different minimal path and cut vectors involved, and as a result was somewhat inaccurate. We also extend to an interval bounds that have previously only been given for availabilities at a fixed point of time.