By Topic

A BDD-based algorithm for analysis of multistate systems with multistate components

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zang, X. ; Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA ; Dazhi Wang ; Hairong Sun ; Trivedi, K.S.

A new algorithm based on binary decision diagram (BDD) for the analysis of a system with multistate components is proposed. Each state of a multistate component is represented by a boolean variable, and a multistate system is represented by a series of multistate fault trees. A Boolean algebra with restrictions on variables is used to address the dependence among these boolean variables that collectively represent the same component and a new BDD operation is proposed to realize this Boolean algebra. Due to the nature of the BDD, the sum of disjoint products (SDP) can be implicitly represented, which avoids huge storage and high computational complexity for large multistate systems. Some applications are given to illustrate the use of our new algorithm.

Published in:

Computers, IEEE Transactions on  (Volume:52 ,  Issue: 12 )