A Minimizing Algorithm for Sum of Disjoint Products

IEEE Transactions on Reliability

Volumn R-36, Issue 4, 1987, Pages 445-453

  Locks, Mitchell O ^a  

^a LOYOLA MARYMOUNT UNIVERSITY   (United States)

Author keywords

Abraham algorithm; Abraham Locks Revised algorithm; disjoint products; sum of disjoint products; System reliability

Indexed keywords

EID: 34548654599     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1987.5222436     Document Type: Article

References (19)

1. J.A. Abraham, “An improved algorithm for network reliability”, IEEE Trans. Reliability, vol. R-28, 1979 Apr, pp. 58–61.
2. K.K. Aggarwal, K.B. Misra, & J.S. Gupta, “A fast algorithm for reliability evaluation”, IEEE Trans. Reliability, vol. R-24, 1975 Apr, pp. 83–85.
3. M. Bellmore, P.A. Jensen, “An implicit enumeration scheme for proper cut generation”, Technometrics, vol. 12, 1970, pp. 775–788.
4. G. Boole, An Investigation of the Laws of Thought, Dover Publications, 1958 (reprint: original publication, 1854).
5. S. Even, Graph Algorithms, Computer Science Press, 1979.
6. L. Fratta, U.G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network”, IEEE Trans. Circuit Theory, vol. CT-20, 1973 May, pp. 203–211.
7. M.R. Garey, D.S. Johnson, Computers and Intractibility, a Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.
8. R.R. Korfhage, Logic and Algorithms, John Wiley & Sons, 1966.
9. M.O. Locks, “Inverting and minimalizing path sets and cut sets”, IEEE Trans. Reliability, vol. R-27, 1978 Jun, pp. 107–109.
10. M.O. Locks, “Inverting and minimizing Boolean functions, minimal paths and minimal cuts: noncoherent system analysis”, IEEE Trans. Reliability, vol. R-28, 1979 Dec, pp. 373–375.
11. M.O. Locks, “Recursive disjoint products, inclusion-exclusion and mincut approximations”, IEEE Trans. Reliability, vol. R-29, 1980 Dec, pp. 368–371.
12. M.O. Locks, “Recursive disjoint products: a review of three algorithms”, IEEE Trans. Reliability, vol. R-31, 1982 Apr, pp. 33–35.
13. M.O. Locks, “Recent developments in computing of system reliability”, IEEE Trans. Reliability, vol. R-34, 1985 Dec, pp. 425–436.
14. W.V. Quine, “The problem of simplifying truth functions”, American Mathematical Monthly, vol. 59, 1952, pp. 521–531.
15. W.V. Quine, “A way to simplify truth functions”, American Mathematical Monthly, vol. 62, 1955, pp. 627–631.
16. D.R. Shier, D.E. Whited, “Algorithms for generating minimal cutsets by inversion”, IEEE Trans. Reliability, vol. R-34, 1985 Oct, pp. 314–319.
17. L. Wittgenstein, Tractatus Logico-Philosophicus, Routledge and Kegan Paul, Ltd, 1922, reissued in 1981.
18. M.O. Locks, “A simplified Boolean version of sdp (sum of disjoint products”, 1987 Proc. Ann. Reliability and Maintainability Symp., pp. 352–354.
19. F. Beichelt, L. Spross, “An improved Abraham method for generating disjoint sums”, IEEE Trans. Reliability, vol. R-36, 1987 Apr, pp. 70–74.