Skip to main content
SpringerLink
Log in

Sample Method for Minimization of OBDDs

  • Conference paper
  • First Online:
SOFSEM’ 98: Theory and Practice of Informatics (SOFSEM 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1521))

Abstract

The exact minimization of the size of Ordered Binary Decision Diagrams (OBDD) is known to be an NP-complete problem. The available heuristical solutions of the problem still do not satisfy requirements of the practical applications. Development of the efficient algorithms that find acceptable variable orders within a short time and with a modest memory overhead is hence higly desired.

In this paper we contribute to the solution of the minimization problem by a new variable reordering heuristic that is based on sampling. A small OBDD sample is chosen from the OBDDs that are considered for minimization. Solving the problem for this small sample, we obtain a variable order that is extrapolated and applied to the entire OBDDs. We present the first experimental results with the Sample Reordering targeted at combinatorial verification. The suggested heuristic is substantially faster than Sifting.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

references

  1. B. Bollig, M. Lobbig, and I. Wegener. Simulated Annealing to Improve Variable Orderings for OBDDs. Proc. IWLS, 5b:5-1–5-10, 1995.

    Google Scholar 

  2. J. Bern, Ch. Meinel, and A. Slobodova. Global Rebuilding of OBDDs-Avoiding Memory Requirement Maxima. Proc. CAV, (LNCS 939:299–308, 1995.

    Google Scholar 

  3. R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, (C-35):677–691, 1986.

    Article  Google Scholar 

  4. B. Bollig and I. Wegener. Improving the Variable Ordering of OBDDs is NP-complete. IEEE Transactions on Computers, (45(9)):993–1002, 1996.

    Article  MATH  Google Scholar 

  5. R. Drechsler, B. Becker, and N. Gockel. A Genetic Algorithm for Variable Ordering of OBDDs. IEEE Proc. Computers and Digital Techniques, 143(6):364–368, 1996.

    Article  Google Scholar 

  6. R. Drechsler, N. Drechsler, and W. Günther. Fast Exact Minimization of BDDs. IEEE/ACM Proc. Design Automation Conference, 1998.

    Google Scholar 

  7. S.J. Friedman, and K.J. Supowit. Finding the Optimal Variable Ordering for Binary Decision Diagrams IEEE/ACM Proc. DAC, 348–356, 1987.

    Google Scholar 

  8. S.J. Friedman, and K.J. Supowit. Finding the Optimal Variable Ordering for Binary Decision Diagrams IEEE Transactions on Computers, 39(5):710–713, 1990.

    Article  MathSciNet  Google Scholar 

  9. N. Ishiura, H. Sawada, and S. Yajima. Minimization of Binary Decision Diagrams Based on Exchanges of Variables IEEE Proc. of ICC AD, 472–475, 1991.

    Google Scholar 

  10. Ch. Meinel and A. Slobodova. On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. Proc. MFCS, (LNCS 841):515–525, 1994.

    Google Scholar 

  11. Ch. Meinel and A. Slobodova. Speeding up Variable Reordering of OBDDs. IEEE Proc. of ICCD, 338–343, 1997.

    Google Scholar 

  12. S. Panda and F. Somenzi. Who are the Variables in Your Neighbourhood. Proc. ACM/IEEE ICCAD, 74–77, 1995.

    Google Scholar 

  13. S. Panda, F. Somenzi, and B.F. Plessier. Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. Proc. ICCAD, 628–631, 1994.

    Google Scholar 

  14. R. Rudell. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. Proc. ACM/IEEE ICCAD, 42–47, 1993.

    Google Scholar 

  15. F. Somenzi. CUDD: CU Decision Diagram Package. Release 2.1.2. University of Colorado, Boulder) (ftp://vlsi.colorado.edu/pub/), 1997.

  16. D. Sieling, and I. Wegener. Reduction of BDDs in Linear Time, Information Processing Letters, 48(3):139–144, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  17. P. Savický, and I. Wegener. Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams Acta Informatica, 34:245–256, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Tani, K. Hamaguchi, and S. Yajima. The Complexity of the Optimal Variable Ordering Problem of Shared Binary Decision Diagrams. Proc. ISAAC, (LNCS762):389–398, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Compaq, Shrewsbury, Massachusets, USA

    Anna Slobodova

  2. Comenius University, Bratislava, Slovakia

    Anna Slobodova

  3. Institute of Telematics, Bahnhofstr 30-32, 54292, Trier, Germany

    Christoph Meinel

  4. FB IV - Informatik, University of Trier, 54286, Trier, Germany

    Christoph Meinel

Authors
  1. Anna Slobodova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, SK-84215, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slobodova, A., Meinel, C. (1998). Sample Method for Minimization of OBDDs. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-49477-4_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65260-1

  • Online ISBN: 978-3-540-49477-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation