Rodrigo Iglesias
ABSTRACT
The evaluation of system reliability is an NP-hard problem even in the binary case. There exist several general methodologies to analyze and compute system reliability. The two main ones are the sum-of-disjoint-products (SDP), which expresses the logic function of the system as a union of disjoint terms, and the Improved Inclusion-Exclusion (IIE) formulas. The algebraic approach to system reliability, assigns a monomial ideal to the system and computes its reliability in terms of the Hilbert series of the ideal, providing an algebraic version of the IIE method. In this paper we make use of this monomial ideal framework and present an algebraic version of the SDP method, based on a combinatorial decomposition of the system's ideal. Such a decomposition is obtained from an involutive basis of the ideal. This algebraic version is suitable for binary and multi-state systems. We include computer experiments on the performance of this approach using the C++ computer algebra library CoCoALib and a discussion on which of the algebraic methods can be more efficient depending on the type of system under analysis.
- J. Abbott and A. M. Bigatti. [n.d.]. CoCoALib: a C++ library for doing Computations in Commutative Algebra. Available at http://cocoa.dima.unige.it/cocoalib.Google Scholar
- J. Abbott, A. M. Bigatti, and L. Robbiano. [n.d.]. CoCoA: a system for doing Computations in Commutative Algebra. Available at http://cocoa.dima.unige.it.Google Scholar
- M. Albert, M. Fetzer, and W. M. Seiler. 2015. Janet Bases and Resolutions in CoCoALib. In Computer Algebra in Scientific Computing - CASC 2015, (Lecture Notes in Computer Science), Vol. 9301. Springer, 15--29.Google Scholar
- A. Aramova, J. Herzog, and T. Hibi. 1997. Weakly stable ideals. Osaka J. Math 34 (1997), 745--745.Google Scholar
- M. Ball. 1986. Computational complexity of network reliability analysis: An overview. IEEE Trans. Rel. R-35 (1986), 230--239.Google ScholarCross Ref
- I. Bermejo and P. Gimenez. 2006. Saturation and Castelnuovo-Mumford regularity. Journal of Algebra 303 (2006), 592--617.Google ScholarCross Ref
- A. M. Bigatti. 1993. Upper bounds for the Betti numbers of a given Hilbert function. Comm. Algebra 21 (1993), 2317--2334.Google ScholarCross Ref
- A. M. Bigatti. 1997. Computation of Hilbert-Poincaré series. Journal of Pure and Applied Algebra 119 (1997), 237--253.Google ScholarCross Ref
- A. M. Bigatti, P. Pascual-Ortigosa, and E. Sáenz-de Cabezón. 2021. A C++ class for multi-state algebraic reliability computations. Reliability Engineering and System Safety 213 (2021), 107751.Google ScholarCross Ref
- R. Bryant. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comp. C-35 (1986), 677--691.Google ScholarDigital Library
- G. Caviglia and E. Sbarra. 2005. Characteristic-free bounds for the Castelnuovo- Mumford regularity. Compos. Math 141 (2005), 1365--1373.Google ScholarCross Ref
- Wolfram Decker, Gert-Martin Greuel, Gerhard Pfister, and Hans Schönemann. 2022. Singular 4--3-0 - A computer algebra system for polynomial computations. http://www.singular.uni-kl.de.Google Scholar
- K. Dohmen. 2003. Improved Bonferroni inequalities via abstract tubes. Springer.Google Scholar
- L. Fratta and U. G. Montanari. 1973. A Boolean algebra method for computing the terminal reliability in a communication network. IEEE Transactions on Circuit Theory 20 (1973), 203--211.Google ScholarCross Ref
- Vladimir Gerdt and Yuri Blinkov. 1998. Involutive bases of polynomial ideals. Mathematics and Computers in Simulation 45 (1998), 519--542.Google ScholarDigital Library
- Vladimir Gerdt and Yuri Blinkov. 1998. Minimal involutive bases. Mathematics and Computers in Simulation 45 (1998), 543--560.Google ScholarDigital Library
- V.P. Gerdt, Y. A. Blinkov, and D. A.. Yanovich. 2001. Construction of Janet Bases I. Monomial Bases. In Computer Algebra in Scientific Computing - CASC 2001. Springer, 233--247.Google ScholarCross Ref
- B. Giglio, D. Q. Naiman, and H. P. Wynn. 2002. Gröbner bases, abstract tubes, and inclusion--exclusion reliability bounds. IEEE Trans. Rel. 51 (2002), 358--366.Google ScholarCross Ref
- B. Giglio and H. P. Wynn. 2004. Monomial ideals and the Scarf complex for coherent systems in reliability theory. Annals of Statistics 32 (2004), 1289--1311.Google ScholarCross Ref
- Daniel R. Grayson and Michael E. Stillman. [n.d.]. Macaulay2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/.Google Scholar
- J. Herzog, D. Popescu, and M. Vladoiu. 2003. On the Ext-modules of ideals of Borel type. In Commutative Algebra: Interactions with Algebraic Geometry, L. L. Avramov, M. Chardin, M. Morales, and C. Polini (Eds.). Amer. Math. Soc., 171--186.Google Scholar
- J. Huang, M. J. Zuo, and Y. Wu. 2000. Generalized Multi-state k-out-of-n:G systems. IEEE Trans. Rel. 49 (2000), 105--111.Google ScholarCross Ref
- H. A. Hulett. 1993. Maximum Betti numbers of homogeneous ideals with a given Hilbert function. Comm. Algebra 21 (1993), 2335--2350.Google ScholarCross Ref
- W. Kuo and M Zuo. 2003. Optimal reliability modelling: principles and applications. John Wiley & sons.Google Scholar
- G. Levitin. 2005. The Universal Generating Function in Reliability Analysis and Optimization. Springer.Google Scholar
- M.O. Locks. 1987. A minimizing algorithm for sum of disjoint products. IEEE Trans. Rel. R-36 (1987), 445--453.Google ScholarCross Ref
- Y. Mo, X. Liudong, Amari S. V., and Dugan J. B. 2015. Efficient analysis of multistate k-out-of-n systems. Reliability Engineering & System Safety 133 (2015), 95--105.Google ScholarCross Ref
- F. Mohammadi, P. Pascual-Ortigosa, E. Sáenz-de-Cabezón, and H.P. Wynn. 2020. Polarization and depolarization of monomial ideals with application to multi-state system reliability. Journal of Algebraic Combinatorics 51 (2020), 617--639.Google ScholarDigital Library
- D. Naiman and H. P. Wynn. 1997. Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling. Annals of Statistics 25 (1997), 547--565.Google ScholarCross Ref
- B. Natvig. 2011. Multi-state systems reliability theory with applications. John Wiley & sons.Google Scholar
- E. Sáenz-de-Cabezón. 2009. Multigraded Betti numbers without computing minimal free resolutions. Appl. Alg. Eng. Commun. Comput. 20 (2009), 481--495.Google ScholarCross Ref
- E. Sáenz-de-Cabezón and H. P.Wynn. 2009. Betti numbers and minimal free resolutions for multi-state system reliability bounds. Journal of Symbolic Computation 44 (2009), 1311--1325.Google ScholarDigital Library
- E. Sáenz-de-Cabezón and H. P. Wynn. 2015. Hilbert functions for design in reliability. IEEE Trans. Rel. 64 (2015), 83--93.Google ScholarCross Ref
- Werner M. Seiler. 2009. A combinatorial approach to involution and regularity I: Involutive bases in polynomial algebras of solvable type. Applicable Algebra in Engineering, Communications and Computing 20 (2009), 207--259.Google ScholarDigital Library
- Werner M. Seiler. 2009. A combinatorial approach to involution and regularity II: Structure analysis of polynomial modules with Pommaret bases. Applicable Algebra in Engineering, Communications and Computing 20 (2009), 261--338.Google ScholarDigital Library
- Werner M. Seiler. 2010. Involution (1st ed.). Springer Verlag.Google Scholar
- K.S. Trivedi and A. Bobbio. 2017. Reliability and availability engineering. Cambridge University Press.Google Scholar
- J.M. Wilson. 1990. An improved minimizing algorithm for sum of disjoint products. IEEE Trans. Rel. R-39 (1990), 42--45.Google Scholar
- Mo Y., Xing L., Amari S.V., and Dugan J.B. 2015. Efficient analysis of multi-state k-out-of-n systems. Reliability Engineering and System Safety 133 (2015), 95--105. https://doi.org/10.1016/j.ress.2014.09.006Google ScholarCross Ref
- W. C. Yeh. 2007. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths. Rel. Eng. Syst. Safety 92 (2007), 260--268.Google ScholarCross Ref
- W. C. Yeh. 2015. An Improved Sum-of-Disjoint-Products Technique for Symbolic Multi-State Flow Network Reliability. IEE Trans. Rel. 64 (2015), 1185--1193.Google ScholarCross Ref
- M. J. Zuo, Z Tian, and H.-Z. Huang. 1995. An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Trans. 25 (1995), 147--163.Google Scholar
Index Terms
- An Algebraic Version of the Sum-of-disjoint-products Method for Multi-state System Reliability Analysis
Recommendations
Polarization and depolarization of monomial ideals with application to multi-state system reliability
AbstractPolarization is a powerful technique in algebra which provides combinatorial tools to study algebraic invariants of monomial ideals. We study the reverse of this process, depolarization which leads to a family of ideals which share many common ...
Reliability evaluation of generalised multi-state k-out-of-n systems based on FMCI approach
Most studies on k-out-of-n systems are in the binary context. The k-out-of-n system has failed if and only if at least k components have failed. The generalised multi-state k-out-of-n: G and F system models are defined by Huang et al. [Huang, J., Zuo, ...
Complementary decompositions of monomial ideals and involutive bases
AbstractComplementary decompositions of monomial ideals—also known as Stanley decompositions—play an important role in many places in commutative algebra. In this article, we discuss and compare several algorithms for their computation. This includes a ...
Comments