New Bounds for All Types of Multi-state Consecutive <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Out-of-<inline-formula> <tex-math notation="LaTeX">$r$ </tex-math></inline-formula>-From-<inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>: F System Reliability

New Bounds for All Types of Multi-state Consecutive <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Out-of-<inline-formula> <tex-math notation="LaTeX">$r$ </tex-math></inline-formula>-From-<inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>: F System Reliability

A multi-state consecutive k-out-of-r-from-n: F system (named MS C(k,r,n:F)) comprises of n linearly ordered components. The MS C(k,r,n:F) and its components have more than 2 states: 0, 1,<sub>&#x22EF;</sub>,H. The state of MS C(k, r, n:F) is less than j if any r consecutive component...

Full description

Bibliographic Details
Main Author: Taha Radwan
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Boole-Bonferroni bounds
upper bound of hunter-worsley
multi-state consecutive <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-out-of-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">r</italic>-from-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">n</italic>: F system
system reliability
Online Access:https://ieeexplore.ieee.org/document/8915841/

Internet

https://ieeexplore.ieee.org/document/8915841/

Similar Items