Abstract
Ordered binary decision diagrams (OBDDs) have already proved useful for example in the verification of combinational and sequential circuits. But the applications are limited, since the decriptive power of OBDDs is limited. Therefore several more general BDD models are studied. In this paper the so-called Parity-OBDDs are considered. The two polynomial time algorithms given are motivated by the fact that Parity-OBDD representation size essentially depends on the variable ordering. The one decides the equivalence of two Parity-OBDDS of possibly distinct variable ordering. The other one transforms a Parity-OBDD with respect to one variable ordering into an equivalent Parity-OBDD with respect to another preassigned variable ordering.
Preview
Unable to display preview. Download preview PDF.
References
J. Bern, C. Meinel, and A. Slobodová. Global rebuilding of obdds avoiding memory requirement maxima, IEEE Trans. on Computers 1996, 15, 131–134.
R. E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers 1986, 35, pp. 677–691.
R. E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comp. on Surveys 1992, 24, pp. 293–318.
B. Bollig, I. Wegener, Improving the variable ordering of OBDDs is NP-complete., Forschungsbericht Nr. 542 (1994) des Fachbereichs Informatik der Universität Dortmund.
D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Computation 1990, 9, pp. 251–280.
St. Fortune, J. Hopcroft, E. M. Schmidt, The complexity of equivalence and containment for free single variable program schemes, in: Proc. ICALP 1978, Lecture Notes in Computer Sci. 62, Springer-Verlag 1978, pp. 227–240.
J. Gergov, Ch. Meinel, Mod-2-OBDDs-a data structure that generalizes EXORSum-of-Products and Ordered Binary Decision Diagrams, Formal Methods in System Design 1996, 8, pp. 273–282.
J. van Leeuwen (edit.), Handbook of theoretical computer science, volume A, Elsevier Science Publishers B.V. 1992.
P. Savický and I. Wegener. Efficient algorithms for the transformation between different types of binary decision diagrams, Acta Informatica 1997 34. pp. 245–256.
I. Wegener, Efficient data structures for Boolean functions, Discrete Mathematics 1994, 136, pp. 347–372.
St. Waack, On the decriptive and algorithmic power of parity ordered binary decision diagrams, in: Proc. 14th STACS 1997, Lecture Notes in Computer Sci. 1200, Springer-Verlag 1997, pp. 201–212.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Behrens, J., Waack, S. (1998). Equivalence test and ordering transformation for parity-OBDDs of different variable ordering. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028564
Download citation
DOI: https://doi.org/10.1007/BFb0028564
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive