Computer ScienceMathematics
DOI: 10.1137/1.9780898719789

tlooto Summary

Theoretical results show that randomized BDDs and Algorithms, based on other Decomposition Rules, can be used in Verification and Model Checking and Application in Optimization, Counting, and Genetic Programming Bibliography Index.

Abstract

Preface Introduction 1. Introduction 2. BPs and Decision Trees (DTs) 3. Ordered Binary Decision Diagrams (OBDDs) 4. The OBDD Size of Selected Functions 5. The Variable-Ordering Problem 6. Free BDDs (FBDDs) and Read-Once BPs 7. BDDs with Repeated Tests 8. Decision Diagrams (DDs) Based on Other Decomposition Rules 9. Integer-Valued DDs 10. Nondeterministic DDs 11. Randomized BDDs and Algorithms 12. Summary of the Theoretical Results 13. Applications in Verification and Model Checking 14. Further CAD Applications 15. Application in Optimization, Counting, and Genetic Programming Bibliography Index.

Citation format

WEGENER, I. Branching programs and binary deci-sion diagrams-theory and applications. DISCRETE APPLIED MATHEMATICS, 1987.