Abstract
In addition to the representation of functions, the efficiency of the manipulation algorithms is very important. In contrast to BDDs, where “all” manipulation operations can be carried out in runtime proportional to the size of the initial graphs, this does not hold for WLDDs, since it may happen that within one step the size becomes exponential. Thus, the algorithms have to be designed very carefully to avoid blow-ups, if possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Drechsler, R. (2000). Implementation of WLDDs. In: Formal Verification of Circuits. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3184-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3184-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4985-1
Online ISBN: 978-1-4757-3184-2
eBook Packages: Springer Book Archive