Approximation and decomposition of binary decision diagrams

Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs....

Full description

Saved in:
Bibliographic Details
Published in:DAC 98: DAC: 35th Annual ACM/IEEE Design Automation Conference pp. 445 - 450
Main Authors: Ravi, Kavita, McMillan, Kenneth L., Shiple, Thomas R., Somenzi, Fabio
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 01.01.1998
IEEE
Series:ACM Conferences
Subjects:
Algorithm design and analysis
Applied computing > Physical sciences and engineering > Engineering
Approximation algorithms
Binary decision diagrams
Boolean functions
Computer systems organization > Dependable and fault-tolerant systems and networks
Contracts
Data structures
General and reference > Cross-computing tools and techniques > Performance
Hardware > Integrated circuits
Hardware > Robustness
Mathematics of computing > Discrete mathematics
Mathematics of computing > Mathematical analysis > Functional analysis > Approximation
Mathematics of computing > Mathematical software
Networks > Network performance evaluation
Partitioning algorithms
Performance analysis
Permission
Reachability analysis
Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis
digital radio
ISM frequency band
spread spectrum communication
transceiver
RF CMOS
ISBN:0897919645, 9780897919647
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs. In this paper we present a new algorithm for approximation and analyze its performance in comparison with existing techniques. We also introduce a new decomposition algorithm that produces balanced partitions. The effectiveness of our contributions is demonstrated by improved results in reachability analysis for some hard problem instances.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:0897919645
9780897919647
DOI:10.1145/277044.277168