Recursive algorithm for the reliability of a connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system |
| |
| Authors: | Hisashi Yamamoto Tomoaki Akiba Hideki Nagatsuka Yurie Moriyama |
| |
| Affiliation: | 1. Faculty of System Design, Tokyo Metropolitan University, 6-6 Asahigaoka, Hino, Tokyo 191-0065, Japan;2. Information Management Engineering, Yamagata College of Industry and Technology, 2-2-1 Matsuei, Yamagata, Yamagata 990-2473, Japan;3. Production Information System, Tokyo Metropolitan Institute of Technology, 6-6 Asahigaoka, Hino, Tokyo 191-0065, Japan |
| |
| Abstract: | ![]()
The connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system is included by the connected-X-out-of-(m, n):F lattice system defined by Boehme et al. [Boehme, T.K., Kossow, A., Preuss, W., 1992. A generalization of consecutive-k-out-of-n:F system. IEEE Transactions on Reliability 41, 451–457]. This system fails if and only if at least one subset of connected failed components occurs which includes at least a (1, 2)-matrix (that is, a row and two columns) or a (2, 1)-matrix(that is, two rows and a column) of failed components. This system is applied to two-dimensional network problems with adjacent constraints, and various systems, for example, a supervision system, etc. |
| |
| Keywords: | Reliability Recursive algorithm Connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system Connected- boldFont" >X-out-of-(m, n):F lattice system |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
