Abstract
The problem of transforming an FBDD (free binary decision diagram) P or a π′OBDD (ordered binary decision diagram with respect to the variable ordering π′) P for the Boolean function f into the reduced πOBDD Q for f is considered. The algorithms run in time O(¦P¦ ¦Q¦log¦Q¦) (where, e.g., ¦P¦ is the size of P) and need space O(¦P¦ +n · ¦Q¦), if P may be an FBDD, or O(¦P¦ + ¦Q¦), if P is known to be an OBDD. The problem is important for the improvement of given variable orderings, e. g., by simulated annealing or genetic algorithms, and in the situation where incompatible representations of functions have to be made compatible.
This research was performed while this author was visiting Univ. Dortmund with a Heinrich-Hertz-grant.
Supported in part by DFG grant We 1066/7-1.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Blum, M., Chandra, A. K. and Wegman, M. W. (1980). Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters 10, 80–82.
Bollig, B., Löbbing, M. and Wegener, I. (1994). Variable orderings for OBDDs, simulated annealing, and the hidden weighted bit function. Submitted to Formal Methods in System Design.
Bryant, R.E. (1986). Graph-based algorithms for Boolean function manipulations. IEEE Trans. on Computer C-35, 677–691.
Bryant, R.E. (1992). Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24, 293–318.
Fortune, S., Hopcroft, J. and Schmidt, E. M. (1978) The complexity of equivalence and containment for free single variable program schemes. Proc. ICALP. Lecture Notes in Computer Science 62, 227–240.
Fujita, M., Matsunaga, Y. and Kakuda, T. (1991). On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. Proc. of European Design Automation Conference EDAC, 50–54.
Gergov, J. and Meinel, Ch. (1992). Efficient analysis and manipulation of OBDDs can be extended to FBDDs. To appear in IEEE Trans. on Computers.
Ishiura, N., Sawada, H. and Yajima, S. (1991). Minimization of binary decision diagrams based on exchanges of variables. Proc. of IEEE Int. Conf. on Computer Aided Design ICCAD, 472–475.
Meinel, Ch. and Slobodová, A. (1994). On the complexity of constructing optimal OBDDs. To appear in MFCS'94.
Mercer, M.R., Kapur, R. and Ross, D.E. (1992). Functional approaches to generating orderings for efficient symbolic representation. Proc. of 29. ACM/IEEE Design Automation Conference, 614–619.
Rudell, R. (1993). Dynamic variable ordering for ordered binary decision diagrams. Proc. of IEEE Int. Conf. on Computer Aided Design ICCAD, 42–47.
Sieling, D. and Wegener, I. (1992). Graph driven BDDs — a new data structure for Boolean functions. To appear in Theoretical Computer Science 143, 1995.
Sieling, D. and Wegener, I. (1993). Reduction of OBDDs in linear time. Information Processing Letters 48, 139–144.
Wegener, I. (1993). Efficient data structures for Boolean functions. To appear in a special volume “Trends in Discrete Mathematics” of Discrete Mathematics.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Savický, P., Wegener, I. (1994). Efficient algorithms for the transformation between different types of binary decision diagrams. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_140
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_140
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive