4.2 Article

IMPROVED AVAILABILITY BOUNDS FOR BINARY AND MULTISTATE MONOTONE SYSTEMS WITH INDEPENDENT COMPONENT PROCESSES

Journal

JOURNAL OF APPLIED PROBABILITY
Volume 54, Issue 3, Pages 750-762

Publisher

CAMBRIDGE UNIV PRESS
DOI: 10.1017/jpr.2017.32

Keywords

Availability bound; binary monotone system; flow network system; minimal cut vector; minimal path vector; multistate monotone system

Ask authors/readers for more resources

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 of the system in an interval, i.e. the probabilities that the system performs above the different levels throughout the whole interval. In complex systems it is often impossible to calculate these availabilities exactly, but if the component performance processes are independent, it is possible to construct lower bounds based on the component availabilities to the different levels over the interval. In this paper we show that by treating the component availabilities over the interval as if they were availabilities at a single time point, we obtain an improved lower bound. Unlike previously given bounds, the new bound does not require the identification of all minimal path or cut vectors.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available