A Characterization of Binary Decision Diagrams

IEEE Transactions on Computers

Volumn 42, Issue 2, 1993, Pages 129-137

  Chakravarty, Sreejit ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Binary Decision Diagrams complexity results. free BDD s; OBDD s; repeated BDD s

Indexed keywords

LOGIC CIRCUITS;

BINARY DECISION DIAGRAMS; BOOLEAN CIRCUITS;

BOOLEAN FUNCTIONS;

EID: 0027541780     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.204789     Document Type: Article

References (33)

1. M. S. Abadir and H. K. Reghabati, “Functional test generation for digital circuits described using binary decision diagram,” IEEE Trans. Comput., vol. C-35, no. 4, pp. 375–379, Apr. 1986
2. A. V. Aho and J. D. Ullman, Principles of Compiler Design. Reading, MA: Addison-Wesley, 1979
3. S. B. Akers, “Binary decision diagrams,” IEEE Trans. Comput., vol. C-27, no. 6, p. 509–516, June 1978
4. S. B. Akers, “Functional testing using binary decision diagrams,” in Proc. 8th Int. Symp. Fault Tolerant Comput., June 1978, pp. 82–92
5. S. B. Akers, “A procedure for functional design verification,” in Proc. IEEE/ ACM 10th Int. Fault Tolerant Comput. Symp., Oct. 1980, pp. 65–67
6. P. Ashar, S. Devadas, and K. Keutzer, “Testability properties of multilevel logic networks derived from binary decision diagrams,” in Proc. Santa Cruz Conf. Advanced Res. VLSI, Mar. 1991, pp. 35–54
7. C. L. Berman, “Ordered binary decision diagrams and circuit structures,” in Proc. IEEE Int. Conf Comput. Design: VLSI in Comput., 1989, pp. 392–395
8. B. Bhattacharya and S. C. Seth, “On the reconvergent structure of combinational circuits with applications to compact testing,” in Proc. IEEE/ACM 17th Int. Fault-Tolerant Comput. Symp., 1987, pp. 264–269
9. M. Blum, A. K. Chandra, and M. N. Wegman, “Equivalence of free Boolean graphs can be decided probabilistically in polynomial time,” Inform. Processing Lett., vol. 10, no. 2, pp. 80–82, Mar. 1980
10. K. S. Brace, R. L. Rudell, and R. E. Bryant, “Efficient implementation of a BDD package,” in Proc. 27th IEEE/ACM Design Automat. Conf, June 1990, pp. 40–45
11. R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Comput., vol. C-35, pp. 677–691, 1986
12. R. E. Bryant, “Symbolic manipulation of Boolean functions using a graphical representation,” in Proc. 22nd IEEE/ACM Design Automat. Conf, June 1985, pp. 688–694
13. R. E. Bryant “Symbolic verification of MOS circuits,” in Proc. 1985 Chapel Hill Conf. VLSI, Computer Science Press, pp. 419–438
14. R. E. Bryant, “On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication,” IEEE Trans. Comput., vol. C-40, no. 2, pp. 205–213, Feb. 1991
15. J. Burch, “Using BDDs to verify multipliers,” in Proc. 1991 Int. Workshop Formal Methods in VLSI Design, Jan. 1991
16. J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill, “Sequential circuit verification using symbolic model checking,” in Proc. 27th IEEE /ACM Design Automat. Conf, pp. 46–51
17. S. Chakravarty and H. B. Hunt III, “On computing signal probability and detection probability for stuck-at faults,” IEEE Trans. Comput., vol. 39, no. 11, pp. 1369–1377, Nov. 1990
18. S. Chakravarty, “A testable multiplexer realization of CMOS combinational circuits,” in Proc. 1989 IEEE Int. Test Conf. pp. 509–518
19. E. Cerny and J. Gecsei, “Simulation of MOS circuits by decision diagrams,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. CAD-4, no. 4, pp. 685–693, 1986
20. O. Coudert, C. Berthet, and J. C. Madre, “Verification of sequential machines using Boolean functional vectors,” in Proc. IMEC-IFIP Int. Workshop Appl. Formal Methods for Correct VLSI Design, Nov. 1989, pp. 111–128
21. S. Fortune, J. Hopcroft, and E. M. Schmidt, “The complexity of equivalence and containment for free variable program schemes,” in Lecture Notes in Computer Science, no. 62, Goos, Hartmanis, Ausiello, and Bohm, Eds. Berlin, Germany: Springer-Verlag, pp. 227–240
22. M. Fujita, H. Fujisawa, and N. Kawato, “Evaluation and improvements of Boolean comparison methods based on binary decision diagrams,” in Proc. IEEE Int. Conf Comput.-Aided Design, Nov. 1988, pp. 2–5
23. M. Fujita, Y. Matsunaga, and T. Kakuda, “Automatic and semi-automatic verification of switch-level circuits with temporal logic and binary decision diagram,” in Proc. IEEE Int. Conf. Comput.-Aided Design, 1990, pp. 38–41
24. H. Fujiwara and S. Toida, “The complexity of fault detection problems for combinational logic circuits,” IEEE Trans. Comput., vol. C-31, pp. 555–560, 1982
25. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman
26. H. B. Hunt III and R. E. Steams, “Monotone Boolean formulae, distributive lattices, and the complexity of logics, algebraic structures, and computation structures,” in Proc. STACS86, 3rd Annu. Symp. Theoret. Aspects Comput. Sci., vol. 210, B. Monien and G. Vidal-Naquet, Eds. Berlin, Germany, Springer-Verlag, 1986, pp. 282–291
27. O. P. Kuznetsov, “Program realization of logical functions and automata Part 1: Analysis and synthesis of binary processes,” Automata and Remote Contr., vol. 38, pp. 1077–1087, 1977
28. C. Lee, “Representation of switching circuits by binary decision programs,” Bell Syst. Tech. J., vol. 38, pp. 985–999, July 1959
29. S. Malik, A. R. Wang, R. Brayton, and A. Sangiovanni-Vincentelli, “Logic verification using binary decision diagrams in a logic synthesis environment,” in Proc. IEEE Int. Conf. Comput.-Aided Design, Nov. 1988, pp. 6–9
30. Y. Matsunaga and M. Fujita, “Multilevel logic optimization using binary decision diagrams,” in Proc. IEEE Int. Conf. Comput.-Aided Design, 1989, pp. 556–559
31. H. Sato, Y. Yasue, Y. Matsunaga, and M. Fujita, “Boolean resubstitution with permissible functions and binary decision diagrams,” in Proc. 27th IEEE/ACM Design Automation Conf, 1990, pp. 284–289
32. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli, “Implicit state enumeration of finite state machines using BDD’s,” in Proc. IEEE Int. Conf Comput.-Aided Design, Nov. 1990, pp. 130–133
33. J. Wegner, “Time-space tradeoffs for branching programs,” J. Comput. Syst. Sci., vol. 32, no. 1, pp. 91–96, Feb. 1986