A new methodology to handle Boolean models with loops

IEEE Transactions on Reliability

Volumn 52, Issue 1, 2003, Pages 96-105

  Rauzy, Antoine ^a  

^a CNRS   (France)

Author keywords

Binary decision diagram; Boolean reliability models with loops; Reliability network

Indexed keywords

ALGORITHMS; DECISION THEORY; FUNCTIONS; RELIABILITY THEORY;

BOOLEAN EQUATIONS;

FAULT TREE ANALYSIS;

EID: 0037333175     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2003.809272     Document Type: Article

References (30)

1. D. R. Shier, Network Reliability and Algebraic Structures: Oxford Science Publications, 1991.
2. J.-C. Madre, O. Coudert, H. Fraïssé, and M. Bouissou, "Application of a new logically complete ATMS to digraph and network-connectivity analysis," in Proc. Annu. Reliability Maintainability Symp., 1994, pp. 118-123.
3. R. Bryant, "Graph based algorithms for Boolean function manipulation," IEEE Trans. Comp., vol. 35, no. 8, pp. 677-691, Aug. 1986.
4. K. Brace, R. Rudell, and R. Bryant, "Efficient implementation of a BDD package," in Proc. 27th ACM/IEEE Design Automation Conf., 1990, pp. 40-45.
5. R. Bryant, "Symbolic Boolean manipulation with ordered binary decision diagrams," ACM Computing Surveys, vol. 24, pp. 293-318, Sep. 1992.
6. O. Coudert and J.-C. Madre, "A new method to compute prime and essential prime implicants of Boolean functions," in Advanced Research in VLSI and Parallel Systems, T. Knight and J. Savage, Eds., Mar 1992, pp. 113-128.
7. A. Ranzy, "New algorithms for fault trees analysis," Reliab. Eng. Syst. Saf., vol. 5, no. 59, pp. 203-211, 1993.
8. M. Fujita, H. Fujisawa, and N. Kawato, "Evaluation and improvements of Boolean comparison method based on binary decision diagrams," in Proc. IEEE Int. Conf. Computer-Aided Design, 1988, pp. 2-5.
9. H. Cho, G. Hatchel, and S. W. Jeong et al., "ATPG aspect of FSM verification," in Proc. IEEE Int. Conf. Computer-Aided Design, 1990.
10. K. M. Butler, D. E. Ross, R. Kapur, and M. R. Mercer, "Heuristics to compute variable orderings for efficient manipulation of ordered BDDs," in Proc. 28th Design Automation Conf., 1991.
11. M. Bouissou, F. Bruyère, and A. Rauzy, "BDD based fault-tree processing: A comparison of variable ordering heuristics," in Proc. European Safety Reliability Association Conf., C. Guedes Soares, Ed: Pergamon (ISBN: 0-08-042 835-5), 1997, vol. 3, pp. 2045-2052.
12. J. D. Andrews and L. M. Barlett, "Efficient basic event orderings for binary decision diagrams," in Proc. Annu. Reliability Maintainability Symp., 1998, (ISSN 0149-144X), pp. 61-67.
13. S.-Y. Kuo, S.-K. Lu, and F.-M. Yeh, "Determining terminal-pair reliability based on edge expansion diagrams using OBDD," IEEE Trans. Rel., vol. 48, no. 3, pp. 234-246, Sep. 1999.
14. A. Rauzy, "Mathematical foundation of minimal cutsets," IEEE Trans. Rel., vol. 50, no. 4, pp. 389-396, Dec. 2001.
15. C. H. Papadimitriou, Computational Complexity: Addison Wesley (ISBN 0-201-53 082-1), 1994.
16. N. Immerman, Descriptive Complexity: Springer Verlag (ISBN 0387-98 600-6), 1998.
17. I. Wegener, "Branching programs and binary decision diagrams-Theory and applications," in SIAM Monographs on Discrete Mathematics and Applications, 2000. (ISBN 0-89 871-458-3).
18. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness: Freeman, 1979.
19. C. R. Reeves, Ed., Modern Heuristics Techniques for Combinatorial Problems: McGraw Hill, 1995. (ISBN 0-07-709 239-2).
20. E. H. L. Aarts and J. K. Lenstra, Eds., Local Search in Combinatorial Optimization: John Wiley & Sons, 1997. (ISBN 0-471-94 822-5).
21. S. Soh and S. Rai, "Experimental results on preprocessing of path/cut terms in sum of disjoint products technique," IEEE Trans. Rel., vol. 42, no. 1, pp. 24-33, 1993.
22. L. B. Page and J. E. Perry, "A practical implementation of the factoring theorem for network reliability," IEEE Trans. Rel., vol. 37, pp. 259-267, 1988.
23. R. Rudell, "Dynamic variable ordering for ordered binary decision diagrams," in Proc. IEEE Int. Conf. Computer-Aided Design, 1993, pp. 42-47.
24. Y. Dutuit, A. Rauzy, and J.-P. Signoret, "Réséda: A reliability network analyzer," in Proc. European Safety Reliability Association Conf., C. Cacciabue and I. A. Papazoglou, Eds: Springer Verlag, 1996, vol. 3, pp. 1947-1952. (ISBN 3-540-76 051-2).
25. S. Lajeunesse, T. Hutinet, and J.-P. Signoret, "Automatic fault trees generation on dynamic systems," in Proc. European Safety Reliability Association Conf., 1996, pp. 1553-1559.
26. E. Duhesme, J.-C. Laleuf, J.-F. Hery, and M. Bouissou, "De la modèlization des systèmes bouclés à la génération automatique d'arbres de défaillances," Actes du congrès λμ, 10, 1996.
27. P. Besnard and P. Siegel et al., "The preferential-models approach to nonmonotonic logics," in Non-Standard Logics for Automated Reasoning, P. Smets et al., Eds: Academic Press, 1988, pp. 127-161.
28. S. Malik, "Analysis of cyclic combinational circuits," IEEE Trans. Computer-Aided Design, vol. 13, no. 7, pp. 950-956, Jul. 1994.
29. N. Halbwachs and F. Maraninchi, "On the symbolic analysis of combinational loops in circuits and synchronous programs," in Proc. Euromicro, 1995.
30. T. R. Shiple, G. Berry, and H. Touati, "Constructive analysis of cyclic circuits," in Proc. Int. Design and Testing Conf., Paris, 1996.