A generalisation of consecutive k-out-of-n : G systems

檔案

本條目沒有附加檔案。

日期

2000-06-01

期刊名稱

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS

摘要

A generalized class of consecutive-k-out-of-n:G systems, referred to as Con/k*/n:G systems, is studied. A Con/k*/n:G system has n ordered components and is good if and only if ki good consecutive components that originate at component i are all good, where k(i) is a function of i. Theorem 1 gives an O(n) time equation to compute the reliability of a linear system and Theorem 2 gives an O(n(2)) time equation for a circular system. A distributed computing system with a linear (ring) topology is an example of such system. This application is very important, since for other classes of topologies, such as general graphs, planar graphs, series-parallel graphs, tree graphs, and star graphs, this problem has been proven to be NP-hard.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料