An efficient algorithm for exact computation of system and survival signatures using binary decision diagrams

Reed, Sean (2017) An efficient algorithm for exact computation of system and survival signatures using binary decision diagrams. Reliability Engineering & System Safety, 165 . pp. 257-267. ISSN 0951-8320

[img] PDF - Repository staff only until 9 April 2018. - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution Non-commercial No Derivatives.
Download (995kB)

Abstract

System and survival signatures are important and popular tools for studying and analysing the reliability of systems. However, it is difficult to compute these signatures for systems with complex reliability structure functions and large numbers of components. This paper presents a new algorithm that is able to compute exact signatures for systems that are far more complex than is feasible using existing approaches. This is based on the use of reduced order binary decision diagrams (ROBDDs), multidimensional arrays and the dynamic programming paradigm. Results comparing the computational efficiency of deriving signatures for some example systems (including complex benchmark systems from the literature) using the new algorithm and a comparison enumerative algorithm are presented and demonstrate a significant reduction in computation time and improvement in scalability with increasing system complexity.

Item Type: Article
Keywords: System signature; Survival signature; Binary decision diagram; System reliability
Schools/Departments: University of Nottingham, UK > Faculty of Engineering
Identification Number: 10.1016/j.ress.2017.03.036
Depositing User: Eprints, Support
Date Deposited: 25 Apr 2017 10:21
Last Modified: 25 Apr 2017 10:25
URI: http://eprints.nottingham.ac.uk/id/eprint/42221

Actions (Archive Staff Only)

Edit View Edit View