Arithmetic and Boolean techniques for derivation of system reliability expressions

• Autorzy: Falkowski B. J. , Lozano C. C. , Łuba T.
• Języki publikacji: EN

Abstrakty

EN

Reliability analysis of a system conducted in the Probabilistic (Arithmetic) domain is lengthy and error-prone. An alternative method is to consider the system reliability components to be Boolean variables rather than Probabilistic variables and to treat the whole problem as if it were Boolean. This method allows the use of powerful Boolean reduction theorems to contain the size of the problem. In order for the conversion of the reliability expression from Boolean domain back to the Probabilistic domain to be on a one-to-one basis, the Boolean expression should be fully disjoint. In this article basic properties and definitions of Probabilistic and Boolean domains are presented. Evaluation of reliability of a system directly from Arithmetic expansion is also discussed. Since the reliability expression may be directly obtained from disjoint cube representation, two methods to obtain disjoint cubes representation of the path set expression of the system are also shown.

Słowa kluczowe

EN

reliability analysis; arithmetic transforms; Boolean techniques

PL

arytmetyka; algebra Boole'a; analiza niezawodności

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: Electronics and Telecommunications Quarterly
• Rocznik: 2008
• Tom: Vol. 54, No 2
• Strony: 167--177
• Opis fizyczny: Bibliogr. 14 poz.

Twórcy

autor

Falkowski B. J.

autor

Lozano C. C.

autor

Łuba T.

• Nanyang Technological University School of Electrical and Electronic Engineering, Singapore

Bibliografia

• 1. J. D. Andrews, T. R. Moss: Reliability and Risk Assessment. ASME Press, New York, 2002.
• 2. J. T. Astola, R. S. Stankovic: Fundamentals of Switching Theory and Logic Design: A Hands on Approach. Springer, Dordrecht, 2006.
• 3. R. E. Barlow: Engineering Reliability. Society for Industrial and Applied Mathematics, Philadelphia, 1998.
• 4. B. J. Falkowski, C. H. Chang: Properties and Methods of Calculating Generalised Arithmetic and Adding Transforms. IEE Proc. On Circuits Devices and Systems, vol. 144, No. 5, October, 1997, pp. 249-258.
• 5. B. J. Falkowski, C. H. Chang: An Efficient Algorithm for the Calculation of Generalized Arithmetic Transforms from Disjoint Cubes of Boolean Functions. VLSI Design, vol. 9, No. 2, April, 1999, pp. 135-146.
• 6. B. J. Falkowski: A Note on the Polynomial Form of Boolean Functions and Related Topics. IEEE Trans. on Computers, vol. 48, No. 8, August, 1999, pp. 860-864.
• 7. B. J. Falkowski: Algorithms for Fast Arithmetic Transform. 35th IEEE International. Symposium on Circuits and Systems, Phoenix, Arizona, USA, 2002, pp. 753-756.
• 8. R. P. Grimaldi: Discrete and Combinatorial Mathematics: An Applied Introduction. Longman, 1998.
• 9. H. Hecht: Systems Reliability and Failure Prevention. Artech House, Boston, 2004.
• 10. S. K. Kumar, M. A. Breuer: Probabilistic Aspects of Boolean Switching Functions via a New Transform. J. of the ACM, vol. 28, No. 3, July, 1981, pp. 502-520.
• 11. W. Kuo, M. J. Zuo: Optimal Reliability Modeling: Principles and Applications. John Wiley & Sons, Hoboken, 2003.
• 12. R. D. Leitch: Reliability Analysis for Engineers. Oxford University Press, Oxford, 1995.
• 13. T. Sasao, M. Fujita: Representations of Discrete Functions. Kluwer Academic Publishers, Boston, 1996.
• 14. M. S. N. Yanushkevich, D. M. Miller, V. P. Shmerko, R. S. Stankovic: Decision Diagram Techniques for Micro- and Nanoelectronic Design. CRC Press, Boca Raton, 2006.