“…The two-dimensional consecutive-k-out-of-n: F system, which was introduced by Salvia and Lasher [17] (see also [8, ll]), consists of n2 components arranged on a square grid of size n and fails, if and only if there exists at least one square grid of size k (2 5 k 5 n -1) that contains all failed components. Any square grid of size k is a minimal cut set, and applying Theorem 2.4, we immediately obtain the following: 2.2).…”
“…The two-dimensional consecutive-k-out-of-n: F system, which was introduced by Salvia and Lasher [17] (see also [8, ll]), consists of n2 components arranged on a square grid of size n and fails, if and only if there exists at least one square grid of size k (2 5 k 5 n -1) that contains all failed components. Any square grid of size k is a minimal cut set, and applying Theorem 2.4, we immediately obtain the following: 2.2).…”
“…In Tables 1-5 we present, for a variety of choices of n 1 , n 2 , k 1 , k 2 , p ij , the values of the bounds described in formulae (16), (17), (18), (20), (21), (23), (24) (they have been labeled as…”
Section: Applicationmentioning
confidence: 99%
“…It was first introduced by Salvia and Lasher (1990) who also discussed several practical applications of the system to real life problems.…”
Section: Applicationmentioning
confidence: 99%
“…In the last few years, several bounds and approximations for system's reliability have been proposed by Salvia and Lasher (1990), , Koutras et al ( , 1996, Koutras (1994, 1995), Yamamoto and Miyakawa (1995), Barbour et al (1996), Makri and Psillakis (1997), and Godbole et al (1998).…”
In this article we introduce generalizations of several well known reliability bounds. These bounds are based on arbitrary partitions of the family of minimal path or cut sets of the system and can be used for approximating the reliability of any coherent structure with iid components. An illustration is also given of how the general results can be applied for a specific reliability structure (two-dimensional consecutive-k 1 × k 2 -out-of-n 1 × n 2 system) along with extensive numerical calculations revealing that, in most cases, the generalized bounds perform better than other available bounds in the literature for this system.
“…Various extensions of the system have been studied. For example, Salvia and Lasher (1990) proposed 2-dimensional consecutive-k-out-ofn:F models in which occurrences of patterns are investigated. Further, some kinds of linear and circular lattice systems were studied by Boehme et al (1992).…”
The method of probability generating functions is extended for obtaining exact distributions of the number of occurrences of a discrete pattern in undirected graphical models. General results for deriving the distributions are given with illustrative examples. Further, a device for reducing calculations is proposed. It works effectively when the graphical model is relatively simple. An algorithm for obtaining the distributions including the device is also given. In order to show the feasibility of our method, exact distributions of the number of occurrences of a "1"-run are derived in two undirected graphical models whose vertices are allocated on a sphere and a torus, respectively. As an application of our results, the exact reliabilities of consecutive-k-out-of-n:F systems corresponding to the undirected graphical models are obtained.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.