Hostname: page-component-89b8bd64d-72crv Total loading time: 0 Render date: 2026-05-07T14:09:52.270Z Has data issue: false hasContentIssue false

Comparing Criticality of Nodes via Minimal Cut (Path) Sets for Coherent Systems

Published online by Cambridge University Press:  27 July 2009

Fan Chin Meng
Affiliation:
Institute of Statistical Science, Academia Sinica Taipei, 11529, Taiwan

Abstract

In 1989, Boland, Proschan, and Tong [2] introduced the notion of criticality ranking among nodes and developed a procedure for obtaining an optimal assignment of components in coherent systems. In this article we obtain characterizations of the criticality ranking in terms of minimal cut (path) sets for coherent systems. Furthermore, utilizing the characterizations, it is shown that the criticality ranking defined by Boland et al. [2] is consistent with the cut-importance ranking introduced by Butler in 1979 [4]. A relationship between the criticality ranking and the well-known and widely used Birnbaum reliability importance measure is also derived.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable