• DocumentCode
    1014333
  • Title

    Reliability of linear and circular consecutively-connected systems

  • Author

    Zuo, Ming J.

  • Author_Institution
    Dept. of Mech. Eng., Alberta Univ., Edmonton, Alta., Canada
  • Volume
    42
  • Issue
    3
  • fYear
    1993
  • fDate
    9/1/1993 12:00:00 AM
  • Firstpage
    484
  • Lastpage
    487
  • Abstract
    J.G. Shanthikumar (IEEE Trans. Reliability, vol.R-36, p.546-50, Dec. 1987) proposed a new system structure called the consecutively connected system, which is a generalization of the well-studied consecutive-k-out-of-n:F system. An O(n 2) algorithm was developed for its reliability evaluation. This work studies the structure of the consecutively connected system and provides more efficient algorithms for its reliability evaluation. The complexities of the algorithms are of order O(kn) for linear systems and O(k3n) for circular systems (k <n). The concepts of transmitting capability and receiving capability are introduced
  • Keywords
    computational complexity; probability; reliability theory; O(k3n) algorithm complexity; O(kn) algorithm complexity; circular systems; consecutive-k-out-of-n:F system; consecutively connected system; linear systems; reliability; Carbon capture and storage; Sufficient conditions;
  • fLanguage
    English
  • Journal_Title
    Reliability, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9529
  • Type

    jour

  • DOI
    10.1109/24.257835
  • Filename
    257835