Abstract
Ordered binary decision diagrams (OBDDs) have found a lot of applications in the verification of combinational and sequential circuits, protocols, and the synthesis and analysis of systems. The applications are limited, since the expressive power of polynomial-size OBDDs is too restricted. Therefore, several more general BDD models are used. Partitioned OBDDs are an OBDD model allowing a restricted use of nondeterminism and different variable orderings. They are restricted enough such that the essential operations can be performed efficiently and they allow polynomial-size representations for many more functions than OBDDs. Here the expressive power of polynomial-size partitioned OBDDs is investigated. A tight hierarchy with respect to the number of parts in the partition is proved and partitioned OBDDs are compared with other BDD models.
Supported in part by DFG grant We 10667.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bollig, B., Sauerhoff, M., Sieling, D., and Wegener, I.: Hierarchy theorems for kOBDDs and kIBDDs. Accepted for publication in Theoretical Computer Science (1997). (Preliminary version: On the power of different types of restricted branching programs. Electronic Colloquium on Computational Complexity. TR 94-026).
Bollig, B. and Wegener, I.: Read-once projections and formal circuit verification with binary decision diagrams. STACS'96, Lecture Notes in Computer Science 1046 (1996), 491–502.
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 35 (1986), 677–691.
Dietzfelbinger, M. and Savický, P.: Parity OBDDs cannot represent the multiplication succinctly. Manuscript, Univ. Dortmund (1997).
Gergov, J. and Meinel, C.: Efficient Boolean manipulation with OBDDs can be extended to FBDDs. IEEE Trans. on Computers 43 (1994), 1197–1209.
Hu, A.J., York, G., and Dill, D.L.: New techniques for efficient verification with implicitly conjoined BDDs. Proc. of 31st ACM/IEEE Design Automation Conference (1994), 276–282.
Jain, J.: On Analysis of Boolean Functions. Ph.D. Thesis, Dept. of Electrical and Computer Engineering, University of Texas at Austin (1993).
Jain, J., Abadir, M., Bitner, J., Fussell, D.S., and Abraham, J.A.: IBDDs: an efficient functional representation for digital circuits. Proc. European Design Automation Conference (1992), 440–446.
Jain, J., Bitner, J., Fussell, D.S., and Abraham, J.A.: Functional partitioning for verification and related problems. Brown/MIT VLSI Conf. (1992), 210–226.
Krause, M.: Lower bounds for depth-restricted branching programs. Information and Computation 91 (1991), 1–14.
Krause, M., Meinel, C., and Waack, S.: Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe. Theoretical Computer Science 86 (1991), 267–275.
Narayan, A., Jain, J., Fujita, M., and Sangiovanni-Vincentelli, A.: Partitioned ROBDDs — a compact, canonical and efficiently manipulable representation for Boolean functions. Proc. of IEEE/ACM Int. Conf. on Computer Aided Design ICCAD'96 (1996), 547–554.
Sieling, D. and Wegener, I.: Graph driven BDDs — a new data structure for Boolean functions. Theoretical Computer Science 141 (1995), 283–310.
Waack, S.: On the descriptive and algorithmic power of parity ordered binary decision diagrams. Proc. of STACS'97, LNCS 1200 (1997), 201–212.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bollig, B., Wegener, I. (1997). Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029959
Download citation
DOI: https://doi.org/10.1007/BFb0029959
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive