
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Arlindo L. Oliveira, Luca P. Carloni, Tiziano Villa, Alberto L. SangiovanniVincentelli, "Exact Minimization of Binary Decision Diagrams Using Implicit Techniques," IEEE Transactions on Computers, vol. 47, no. 11, pp. 12821296, November, 1998.  
BibTex  x  
@article{ 10.1109/12.736442, author = {Arlindo L. Oliveira and Luca P. Carloni and Tiziano Villa and Alberto L. SangiovanniVincentelli}, title = {Exact Minimization of Binary Decision Diagrams Using Implicit Techniques}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {11}, issn = {00189340}, year = {1998}, pages = {12821296}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.736442}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Exact Minimization of Binary Decision Diagrams Using Implicit Techniques IS  11 SN  00189340 SP1282 EP1296 EPD  12821296 A1  Arlindo L. Oliveira, A1  Luca P. Carloni, A1  Tiziano Villa, A1  Alberto L. SangiovanniVincentelli, PY  1998 KW  Binary decision diagrams KW  incompletely specified functions KW  minimization of logic functions KW  incompletely specified finite state machines KW  state minimization KW  implicit logic computations. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don't care sets. Specifically, given an incompletely specified function
[1] A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, "Occam's Razor," Information Processing Letters, vol. 24, NorthHolland, pp. 377380, 1987.
[2] K.S. Brace, R.L. Rudell, and R.E. Bryant, Efficient Implementation of a BDD Package Proc. Design Automation Conf., pp. 4045, 1990.
[3] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. SangiovanniVincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[4] R.E. Bryant, "GraphBased Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C35, No. 8, Aug. 1986, pp. 667690.
[5] S.C. Chang, D.I. Cheng, and M. MarekSadowska, "Minimizing ROBDD Size of Incompletely Specified Multiple Output Functions," Proc. European Design and Test Conf., pp. 620624, Mar. 1994.
[6] O. Coudert, C. Berthet, and J.C. Madre, "Verification of Sequential Machines Using Functional Boolean Vectors," Proc. IFIP Int'l Workshop, Applied Formal Methods for Correct VLSI Design, Nov. 1989.
[7] O. Coudert,C. Berthet,, and J.C. Madre,“Verification of synchronous sequential machines based on symbolic execution,” LNCS: Automatic Verification Methods for Finite State Systems, J. Sifakis, ed., vol. 407, SpringerVerlag, June 1989, pp. 365373.
[8] A. Grasselli and F. Luccio, "A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks," IRE Trans. Electronic Computers, vol. 14, no. 3, pp. 350359, June 1965.
[9] K. Hirata, S. Shimozono, and A. Shinoara, "On the Hardness of Approximating the Minimum Consistent OBDD Problem," Proc. Fifth Scandinavian Workshop Algorithm Theory, July 1996.
[10] T. Kam, T. Villa, R. Brayton, and A. SangiovanniVincentelli, "A Fully Implicit Algorithm for Exact State Minimization," Proc. Design Automation Conf., pp. 684690, June 1994.
[11] T. Kam, T. Villa, R. Brayton, and A. SangiovanniVincentelli, Synthesis of FSMs: Functional Optimization. Kluwer Academic, 1997.
[12] L. Lavagno, P. McGeer, A. Saldanha, and A.L. SangiovanniVincentelli, "Timed Shannon Circuits: A PowerEfficient Design Style and Synthesis Tool," Proc. 32nd Design Automation Conf., pp. 254260, June 1995.
[13] A. Oliveira, L. Carloni, T. Villa, and A. SangiovanniVincentelli, "Exact Minimization of Binary Decision Diagrams Using Implicit Techniques," Technical Report No. UCB/ERL M96/16, Apr. 1996.
[14] A.L. Oliveira, "Inductive Learning by Selection of Minimal Complexity Representations," PhD thesis, Univ. of California, Berkeley, Electronics Research Laboratory, College of Eng., Univ. of California, Berkeley, Dec. 1994. Memorandum No. UCB/ERL M94/97.
[15] R. Ranjan, T. Shiple, and R. Hojati, "Exact Minimization of BDDs Using Don't Cares," EE290ls Project Report, May 1993.
[16] M. Sauerhoff and I. Wegener, "On the Complexity of Minimizing the OBDD Size for Incompletely Specified Functions," Forschungsbericht Nr. 560, Universität Dortmund, 1994.
[17] T. Shiple, R. Hojati, A. SangiovanniVincentelli, and R. Brayton, "Heuristic Minimization of BDDs Using Don't Cares," Proc. Design Automation Conf., pp. 225231, June 1994.
[18] Y. Takenaga and S. Yajima, "NPCompleteness of Minimum Binary Decision Diagram Identification," Technical Report COMP 9299, Inst. of Electronics, Information, and Comm. Engineers (of Japan), Mar. 1993.
[19] H. Touati, H. Savoj, B. Lin, R. Brayton, and A. SangiovanniVincentelli, "Implicit State Enumeration of Finite State Machines Using BDDs," Proc. Int'l Conf. ComputerAided Design, pp. 130133, 1990.