Skip to main content
Springer Nature Link
Log in

On the composition problem for OBDDs with multiple variable orders

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1998 (MFCS 1998)

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

  • 157 Accesses

Abstract

Ordered Binary Decision Diagram (OBDD) is a favorite data structure used for representation Boolean functions in computer-aided synthesis and verification of digital systems. The secret of its success is the efficiency of the algorithms for Boolean operations, satisfiability and equivalence check. However, the algorithms work well under condition only that the variable order of considered OBDDs is the same.

In this paper, we discuss the problem of Boolean operations on OBDDs with multiple variable orders, which naturally appears, e.g., in the connection with minimization techniques based on dynamic variable reordering. Our goal is to place the problem with respect to its complexity and to point out the difficulties in finding an acceptable solution.

This work has been supported by German Research Society project Me 1077/12-1

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.S. Brace, R.L. Rudel, and R.E. Bryant. Efficient Implementation of a BDD Package. ACM/IEEE Proc. Design Automation Conference, pages 40–45, 1990.

    Google Scholar 

  2. R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transaction on Computers, C-35:677–691, 1986.

    Google Scholar 

  3. R.E. Bryant. Symbolic Boolean Manipulation With Ordered Binary Decision Diagrams. Comp. Surveys, 24:293–318, 1992.

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. G. Cabodi and S. Quer and Ch. Meinel and H. Sack and A. Slobodová and Ch. Stangier. Binary Decision Diagrams and Multiple Variable Order Problem International Workshop on Logic Synthesis'98, Lake Tahoe, CA

    Google Scholar 

  6. M.R. Garey and D.S. Johnson. Computers And Intractability — A guide to NP-Completness. Freeman, 1979.

    Google Scholar 

  7. M. Krause, Ch. Meinel, and S. Waack. Separating the Eraser Turing Machine Classes Le, NLe and Pe. TCS, 86:267–275, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  8. Ch. Meinel and A. Slobodová. On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. Proc. of MFCS, LNCS 841:515–525, 1994.

    Google Scholar 

  9. D. Sieling and I. Wegener. Reduction of bdds in linear time. Information Processing Letters, 48(3):139–144, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  10. 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 

  11. S. Tani, K. Hamaguchi, and S. Yajima. The Complexity of the Optimal Variable Ordering Problem of Shared Binary Decision Diagrams. In Proc. ISAAC, LNCS 762, pages 389–398. Springer, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telematics, Trier, Germany

    Anna Slobodová

Authors
  1. Anna Slobodová
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slobodová, A. (1998). On the composition problem for OBDDs with multiple variable orders. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055815

Download citation

  • DOI: https://doi.org/10.1007/BFb0055815

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

  • Online ISBN: 978-3-540-68532-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics