Abstract
Ordered binary decision diagrams (OBDDs) and parity OBDDs are data structures representing Boolean functions. In addition, we study their generalization which we call parity AOBDDs, give their algebraic characterization and compare their minimal size to the size of parity OBDDs.
We prove that the constraint that no arcs test conditions of type x i = 0 does not affect the node-size of parity (A) OBDDs and we give an efficient algorithm for finding such parity (A) OBDDs. We obtain a canonical form for parity OBDDs and discuss similar results for parity AOBDDs
Algorithms for minimization and transformation to the canonical form for parity OBDDs running in time O(S 3) and space O(S 2) or in time O(S 3/logS) and space O(S 3/ logS) and an algorithm for minimization of parity AOBDDs running in time O(nS 3) and space O(nS 2) are presented (n is the number of variables, S is the number of vertices).
All the results are extendable to case of shared parity (A) OBDDs — data structures for representation of Boolean function sequences.
Supported by GAUK 158/99
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arlazarov, L., Dinic, E. A., Kronrod, A., Faradzev, I. A.: On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk USSR 1970, 194, pp. 487–488 (in Russian), Soviet. Math. Dokl. 11, pp. 1209-1210 (in English)
Bryant, R. E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 1986, 35, pp. 677–691
Bryant, R. E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comp. Surveys 1992, 24, pp. 293–318
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Computation 1990, 9, pp. 251–280
Gergov, J., Meinel, Ch.: Mod-2-OBDDs — a data structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams. Formal Methods in System Design 1996, 8, pp. 273–282
Král’, D.: Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization. ECCC report TR00-013
Löbbing, M., Sieling, D., Wegener, I.: Parity OBDDs cannot be handled efficiently enough. Information Processing Letters 1998, 67, pp. 163–168
Waack, St.: On the descriptive and algorithmic power of parity ordered binary decision diagrams. Proc. 14th STACS 1997, Lecture Notes in Computer Sci. 1200, Springer Verlag 1997, pp. 201–212
Wegener, I.: Branching Programs and Binary Decision Diagrams — Theory and Applications. To appear (2000) in the SIAM monograph series Trends in Discrete Mathematics and Applications ed. P. L. Hammer.
Wegener, I.: Efficient data structures for Boolean functions. Discrete Mathematics 1994, 136, pp. 347–372
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Král’, D. (2000). Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_43
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive