Advances in Applied Probability

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

J. Gåsemyr

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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 and 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 also treated 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 interval bounds that have previously only been given for availabilities at a fixed point of time.

Article information

Source
Adv. in Appl. Probab., Volume 44, Number 1 (2012), 292-308.

Dates
First available in Project Euclid: 8 March 2012

Permanent link to this document
https://projecteuclid.org/euclid.aap/1331216654

Digital Object Identifier
doi:10.1239/aap/1331216654

Mathematical Reviews number (MathSciNet)
MR2951556

Zentralblatt MATH identifier
1279.62208

Subjects
Primary: 62N05: Reliability and life testing [See also 90B25] 90B25: Reliability, availability, maintenance, inspection [See also 60K10, 62N05]

Keywords
Availability bound minimal cut vector minimal path vector modular decomposition multistate monotone system

Citation

Gåsemyr, J. Bounds for the availabilities of multistate monotone systems based on decomposition into stochastically independent modules. Adv. in Appl. Probab. 44 (2012), no. 1, 292--308. doi:10.1239/aap/1331216654. https://projecteuclid.org/euclid.aap/1331216654


Export citation