IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v240y2026i2p495-507.html

Signature reliability scrutiny of complex communication system utilizing path tracing approach with bounds

Author

Listed:
  • Sadiya Naaz
  • Mangey Ram
  • Akshay Kumar

Abstract

It is widely accepted that the reliability of aerospace devices is essential for aircraft during flight because the operational efficiency of aviation systems directly impacts the safety of flight. In complex structures, it is challenging to estimate accurate reliability properly. As a consequence, firstly the complex aerospace communication system is proposed with its logical and graphical representation to evaluate their min-paths and min-cuts via prevalence matrix and least cut matrix respectively. Secondly, we evaluate the accurate reliability function for the proposed system using the matrix-based approach namely the path tracing approach. Its polynomial form will allow the evaluation of the tail signature. Thirdly, by utilizing the tail signature, the signature reliability and cumulative signature have been depicted easily. Then, we deduce the lower and upper constraints for two-terminal reliability and methodologies, which will allow us to enhance the reliability of the proposed system using the Esary-Proschan bound and edge-packing bound with their upper and lower bounds. The reliability makes use of a listed set of min-pathways and a listed set of min-cuts. Lastly, the expected operational lifespan is estimated using the reliability of the provided complex model.

Suggested Citation

  • Sadiya Naaz & Mangey Ram & Akshay Kumar, 2026. "Signature reliability scrutiny of complex communication system utilizing path tracing approach with bounds," Journal of Risk and Reliability, , vol. 240(2), pages 495-507, April.
  • Handle: RePEc:sae:risrel:v:240:y:2026:i:2:p:495-507
    DOI: 10.1177/1748006X251401060
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X251401060
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1748006X251401060?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:risrel:v:240:y:2026:i:2:p:495-507. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.