Skip to main content
SpringerLink
Log in

Consecutive Systems Asymptotic Threshold Behaviors

  • Conference paper
  • First Online:
Soft Computing Applications (SOFA 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1438))

Included in the following conference series:

  • 81 Accesses

Abstract

Consecutive systems are one of the recently and well studied families of networks. However, they still have plenty to reveal with respect to their reliability behaviors, as pointed out by a plethora of fresh results in this direction. Here, we will apply the concept of average reliability to this family of networks, and derive a closed formula for the average reliability of a linear consecutive system. With this result at hand, we study and analyze the asymptotic behavior properties. Lastly, we propose an approximation for the average reliability, which is close to the exact value and can be computed efficiently.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brown, J.I., Colbourn, C.J., Cox, D., Graves, C., Mol, L.: Network reliability: heading out on the highway. Networks 77(1), 146–160 (2021)

    Article  MathSciNet  Google Scholar 

  2. Brown, J.I., Cox, D., Ehrenborg, R.: The average reliability of a graph. Discret. Appl. Math. 177(20), 19–33 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Beichl, I., Cloteaux, B., Sullivan, F.: An approximation algorithm for the coefficients of the reliability polynomial. Congr. Numer. 197, 143–151 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Beiu, V., Hoara, S.H., Beiu, R.M.: Bridging reliability to efficiency consecutive elegant and simple design. In: Dzitac, S., Dzitac, D., Filip, F.G., Kacprzyk, J., Manolescu, M.J., Oros, H. (eds.) ICCCC 2022. AISC, vol. 1435, pp. 387–400. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-16684-6_33

    Chapter  Google Scholar 

  5. Dăuş, L., Beiu, V.: Lower and upper reliability bounds for consecutive-\(k\)-out-of-\(n\):\({F}\) systems. IEEE Trans. Reliab. 64(3), 1128–1135 (2015)

    Article  Google Scholar 

  6. Drăgoi, V.-F., Cristescu, G.: Bhattacharyya parameter of monomial codes for the binary erasure channel: from pointwise to average reliability. Sensors 21(9) (2021). Art. 2976(1–24)

    Google Scholar 

  7. Drăgoi, V.-F., Cowell, S., Beiu, V.: Tight bounds on the coefficients of consecutive k-out-of-n:F systems. In: Dzitac, I., Dzitac, S., Filip, F.G., Kacprzyk, J., Manolescu, M.-J., Oros, H. (eds.) ICCCC 2020. AISC, vol. 1243, pp. 35–44. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-53651-0_3

    Chapter  Google Scholar 

  8. de Moivre, A.: The Doctrine of Chances - A Method of Calculating the Probabilities of Events in Play, 2nd edn. H. Woodfall, London (1738)

    Google Scholar 

  9. Dohmen, K.: Improved inclusion-exclusion identities and Bonferroni inequalities with applications to reliability analysis of coherent systems, May 2000

    Google Scholar 

  10. Guo, H., Jerrum, M.: A polynomial-time approximation algorithm for all-terminal network reliability. SIAM J. Comput. 48(3), 964–978 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hwang, F.K.: Simplified reliabilities for consecutive-\(k\)-out-of-\(n\) systems. SIAM J. Alg. Discrete Math. 7(2), 258–264 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lambiris, M., Papastavridis, S.: Exact reliability formulas for linear & circular consecutive-\(k\)-out-of-\(n\):\({F}\) systems. IEEE Trans. Reliab. R-34(2), 124–126 (1985)

    Google Scholar 

  13. Moskowitz, F.: The analysis of redundancy networks. Trans. Am. Inst. Electr. Eng. Part I Commun. Electron. 77(5), 627–632 (1958)

    Google Scholar 

  14. Moore, E.F., Shannon, C.E.: Reliable circuits using less reliable relays - Part I. J. Franklin Inst. 262(3), 191–208 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  15. Moore, E.F., Shannon, C.E.: Reliable circuits using less reliable relays - Part II. J. Franklin Inst. 262(4), 281–297 (1956)

    Article  MATH  Google Scholar 

  16. Philippou, A.N., Makri, F.S.: Successes, runs and longest runs. Stat. Probab. Lett. 4(2), 101–105 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shanthikumar, J.G.: Recursive algorithm to evaluate the reliability of a consecutive-\(k\)-out-of-\(n\):F system. IEEE Trans. Reliab. R-31(5), 442–443 (1982)

    Google Scholar 

  18. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  19. von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. Ann. Math. Stud. 34, 43–98 (1956)

    MathSciNet  Google Scholar 

Download references

Acknowledgment

V-F. Drăgoi was supported by a grant of the Ministry of Research, Innovation and Digitization, CNCS/CCCDI - UEFISCDI, project number PN-III-P1-1.1-PD-2019-0285, within PNCDI III.

V. Beiu was supported by the EU through the European Research Development Fund under the Competitiveness Operational Program (BioCell-NanoART = Novel Bio-inspired Cellular Nano-ARchiTectures, POC-A1-A1.1.4-E-2015 nr. 30/01.09.2016), and by a grant of the Romanian Ministry of Education and Research, CNCS-UEFISCDI, project number PN-III-P4-ID-PCE-2020-2495, within PNCDI III (ThUNDER\(^2\) = Techniques for Unconventional Nano-Designing in the Energy-Reliability Realm).

Author information

Authors and Affiliations

  1. “Aurel Vlaicu” University of Arad, 310330, Arad, Romania

    Vlad-Florin Drăgoi & Valeriu Beiu

Authors
  1. Vlad-Florin Drăgoi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valeriu Beiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vlad-Florin Drăgoi .

Editor information

Editors and Affiliations

  1. Faculty of Engineering, Department of Automatics and Applied Software, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Balas

  2. Aurel Vlaicu University of Arad, Arad, Romania

    Lakhmi C. Jain

  3. Faculty of Engineering, Department of Automatics and Applied Software, Aurel Vlaicu University of Arad, Arad, Romania

    Marius Mircea Balas

  4. Cankaya University, Ankara, Türkiye

    Dumitru Baleanu

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Drăgoi, VF., Beiu, V. (2023). Consecutive Systems Asymptotic Threshold Behaviors. In: Balas, V.E., Jain, L.C., Balas, M.M., Baleanu, D. (eds) Soft Computing Applications. SOFA 2020. Advances in Intelligent Systems and Computing, vol 1438. Springer, Cham. https://doi.org/10.1007/978-3-031-23636-5_53

Download citation

Publish with us

Policies and ethics

Search

Navigation