Zero-suppressed BDDs and their applications

International Journal on Software Tools for Technology Transfer

Volumn 3, Issue 2, 2001, Pages 156-170

  Minato, Shin ichi ^a  

^a NTT Network Innovation Laboratories   (Japan)

Author keywords

BDD; Boolean function; Combinatorial problem; VLSI CAD; ZBDD

Indexed keywords

BDD; COMBINATORIAL PROBLEM; LOGIC SYNTHESIS; ORDERED BINARY DECISION DIAGRAMS; REAL-LIFE PROBLEMS; VLSI CAD; ZBDD;

BOOLEAN FUNCTIONS; PETRI NETS;

DATA STRUCTURES;

EID: 84896692824     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090100038     Document Type: Article

References (31)

1. Becker, B., Drechsler, R., Theobald, M.: On the implementation of a package for efficient representation and manipulation of functional decision diagrams. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expression in Circuit Design, pp. 162-169, 1993
2. Brayton, R.K., Rudell, R., Sangiovanni-Vincentelli, A., Wang, A.R.: MIS: a multiple-level logic optimization system. IEEE Trans. on Computer-Aided Design 6(6): 1062-1081, 1987
3. Bryant, R.E., Chen, Y.-A.: Verification of arithmetic functions with binary moment diagrams. Proc. 32nd ACM/IEEE Design Automation Conf. (DAC'95), pp. 535-541, June 1995
4. Coudert, O., Madre, J.C.: Implicit and incremental computation of primes and essential primes of Boolean functions. In: Proc. of 29th ACM/IEEE Design Automation Conf. (DAC'92), pp. 36-39, June 1992
5. Coudert, O., Madre, J.C., and Fraisse, H.: Anew viewpoint of two-level logic optimization. In: Proc. of 30th ACM/IEEE Design Automation Conf. (DAC'93), pp. 625-630, June 1993
6. Coudert, O., Madre, J.C., Touati, H.: TiGeR Version 1.0 User Guide. Digital Paris Research Lab., December 1993
7. Coudert, O.: Solving graph optimization problems with ZB-DDs. Proc. of ACM/IEEE Eur. Design and Test Conf. (ED&TC-97), 1997
8. Drechsler, R., Theobald, M., Becker, B.: Fast OFDD-based minimization of fixed polarity Reed-Muller expressions. Proc. of Eur. Conf. on Design Automation, pp. 2-7, 1994
9. Drechsler, R., Sieling, D.: Binary decision diagrams in theory and practice. Int. J. Software Tools for Technology Transfer, 1999 (This issue)
10. Kebschull, U., Schubert, E., Rosenstiel, W.: Multilevel logic synthesis based on functional decision diagrams. Proc. of Eur. Conf. on Design Automation, pp. 43-47, March 1992
11. Liaw, H.-T., Lin, C.-S.: On the OBDD-representation of general Boolean functions. IEEE Trans. on Computers C-41(6): pp. 661-664, June 1992
12. Lin, B., Somenzi, F.: Minimization of symbolic relations. In: Proc. of IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD'90), pp. 88-91, November 1990
13. M. Löbbing, Wegener, I.: The number of knight's tour equals 33, 439, 123, 484, 294 counting with binary decision diagrams. The Electronic J. Combinatorics 3:#R5, 1996
14. Matsunaga, Y., Fujita, M.: Multi-level logic optimization using binary decision diagrams. Proc. of IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD'89), pp. 556-559, November 1989
15. Minato, S.: Fast generation of irredundant sum-of-products forms from binary decision diagrams. Proc. of Synthesis and Simulation Meeting and International Interchange (SASIMI'92, Kobe, Japan), pp. 64-73, April 1992
16. Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. of 30th ACM/IEEE Design Automation Conference (DAC'93), pp. 272-277, June 1993
17. Minato, S.: Calculation of unate cube set algebra using zerosuppressed BDDs. Proc. of 31st ACM/IEEE Design Automation Conference (DAC'94), pp. 420-424, June 1994
18. Minato, S.: Implicit manipulation of polynomials using zerosuppressed BDDs. Proc. of ACM/IEEE Europian Design and Test Conf. (ED&TC-95), pp. 449-454, Mar. 1995
19. Minato, S.: Fast factorization method for implicit cube set representation. IEEE Trans. on CAD 15(4), pp. 377-384, Apr. 1996
20. Minato, S.: Arithmetic Boolean expression manipulator using BDDs. Formal Methods in System Design, Kluwer Academic, Boston, Mass., USA 10: 221-242, 1997
21. Morreale, E.: Recursive operators for prime implicant and irredundant normal form determination. IEEE Trans. Comput. C-19(6): 504-509, June 1970
22. Murata, T.: Petri nets: properties, analysis and applications. Proc. of the IEEE 77(4): 541-580, 1989
23. Muroga, S., Kambayashi, Y., Lai, H.C., Culliney, J.N.: The transduction method design of logic networks based on permissible functions. IEEE Trans. on Computers Vol. C-38, 10: 1404-1424, October 1987
24. Ochi, H., Yasuoka, K., Yajima, S.: Breadth-first manipulation of very large binary-decision diagrams. In: Proc. Of IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD'93), pp. 48-55, November 1993
25. Okuno, H.G.: Reducing combinatorial explosions in solving search-type combinatorial problems with binary decision diagram. Trans. of Information Processing Society of Japan (IPSJ), (in Japanese) 35(5): 739-753, 1994
26. Okuno, H.G., Minato, S., Isozaki, H.: On the properties of combination set operations. Information Processing Letters 66: 195-199, 1998
27. Ranjan, R.K., Sanghavi, J.: CAL-2.0: breadth-first manipulation-based BDD library. Public software. Univ. of California, Berkeley, Calif., USA, June 1997. http://www-cad.eecs.berkeley.edu/Research/cal_bdd/
28. Somenzi, F.: CUDD: CU decision diagram package. Public Software. University of Colorado, Boulder, Colo., USA, April 1997. http://vlsi.colorado.edu/fabio/CUDD
29. Takahashi, N., Ishiura, N., Yajima, S.: Fault simulation for multiple faults using BDD representation of fault sets. Proc. of IEEE/ACM In. Conf. on Computer-Aided Design (IC-CAD'91), pp. 550-553, November 1991
30. Wegener, I.: The size of reduced OBDDs and optimal readonce branching programs for almost all Boolean functions. IEEE Trans. on Computers C-43(11): 1262-1269, November 1994
31. Yoneda, T., Hatori, H., Takahara, A., Minato, S.: BDDs vs. zero-suppressed BDDs: for CTL symbolic model checking of Petri nets. Proc. of 1st Int. Conf. on Formal Method in Computer Design (FMCAD'96, Palo Alto, Calif., USA, pp. 435-449, November, 1996