CSDL Home IEEE Transactions on Dependable and Secure Computing 2009 vol.6 Issue No.03 - July-September

Subscribe

Issue No.03 - July-September (2009 vol.6)

pp: 161-174

ABSTRACT

Multistate systems can model many practical systems in a wide range of real applications. A distinct characteristic of these systems is that the systems and their components may assume more than two levels of performance (or states), varying from perfect operation to complete failure. The nonbinary property of multistate systems and their components makes the analysis of multistate systems difficult. This paper proposes a new decision-diagram-based method, called multistate multivalued decision diagrams (MMDD), for the analysis of multistate systems with multistate components. Examples show how the MMDD models are generated and evaluated to obtain the system-state probabilities. The MMDD method is compared with the existing binary decision diagram (BDD)-based method. Empirical results show that the MMDD method can offer less computational complexity and simpler model evaluation algorithm than the BDD-based method.

INDEX TERMS

Binary decision diagram, multistate fault tree, multistate system, multistate multivalued decision diagram.

CITATION

Liudong Xing, Yuanshun Dai, "A New Decision-Diagram-Based Method for Efficient Analysis on Multistate Systems",

*IEEE Transactions on Dependable and Secure Computing*, vol.6, no. 3, pp. 161-174, July-September 2009, doi:10.1109/TDSC.2007.70244REFERENCES

- [8] J.B. Dugan and S.A. Doyle, “New Results in Fault-Tree Analysis,”
Tutorial Notes of the Ann. Reliability and Maintainability Symp., Jan. 1996.- [9] M. Rausand and A. Hoyland,
System Reliability Theory: Models, Statistical Methods, and Applications, second ed. Wiley-Interscience, 2003.- [17] W.S. Griffith, “Multistate Reliability Models,”
J. Applied Probability, vol. 17, pp. 735-744, 1980.- [19] C.Y. Lee, “Representation of Switching Circuits by Binary-Decision Programs,”
Bell Systems Technical J., vol. 38, pp. 985-999, July 1959.- [22] R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,”
IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.- [24] D.M. Miller and R. Drechsler, “Implementing a Multiple-Valued Decision Diagram Package,”
Proc. 28th Int'l Symp. Multiple-Valued Logic (ISVML), 1998.- [26] G. Ciardo and R. Siminiceanu, “Saturation: An Efficient Iteration Strategy for Symbolic State Space Generation,”
Tools and Algorithms for the Construction and Analysis of Systems, T. Margaria and W. Yi, eds., pp. 328-342, 2001.- [27] H. Hermanns, J. Meyer-Kayser, and M. Siegle, “Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains,”
Numerical Solution of Markov Chains, W.J. Stewart, B. Plateau, and M. Silva, eds., pp. 188-207, 1999.- [29] G. Ciardo, “Reachability Set Generation for Petri Nets: Can Brute Force Be Smart,”
Proc. 25th Int'l Conf. Applications and Theory of Petri Nets (ICATPN '04), pp. 17-34, 2004.- [30] A.S. Miner and G. Ciardo, “Efficient Reachability Set Generation and Storage Using Decision Diagrams,”
Application and Theory of Petri Nets, H. Kleijn and S. Donatelli, eds., pp. 6-25, 1999.- [31] D. Zampunieris, B.L. Charlier, “Efficient Handling of Large Sets ofTuples with Sharing Trees,”
Proc. IEEE Data Compression Conf.(DCC '95), Oct. 1995.- [32] J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang, “Symbolic Model Checking: $10^{20}$ States and Beyond,”
Proc.FifthAnn. IEEE Symp. Logic in Computer Science (LICS '90), pp. 1-33, 1990.- [34] M.-M. Corsini and A. Rauzy, “Symbolic Model Checking andConstraint Logic Programming: A Cross-Fertilization,”
Proc.Fifth European Symp. Programming (ESOP '94), pp. 180-194, Apr. 1994.- [37] L. Xing, “Dependability Modeling and Analysis of Hierarchical Computer-Based Systems,” PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of Virginia, May 2002.
- [40] L. Xing and J.B. Dugan, “Dependability Analysis Using Multiple-Valued Decision Diagrams,”
Proc. Sixth Int'l Conf. Probabilistic Safety Assessment and Management, June 2002.- [47] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein,
Introduction to Algorithms, second ed. MIT Press, 2001. |