A rewriting approach to binary decision diagrams

Journal of Logic and Algebraic Programming

Volumn 49, Issue 1-2, 2001, Pages 61-86

  Zantema, Hans ^a   Van De Pol, Jaco ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Binary deciison diagrams; Decision tree; Reduction length; Reduction strategies; Shared rewriting; Term rewriting

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DECISION THEORY;

BINARY DECISION DIAGRAMS ((BDD);

BINARY CODES;

EID: 0034751551     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(01)00013-3     Document Type: Article

References (18)

1. Boolean expression diagrams
2. Graph-based algorithms for boolean function manipulation
3. Symbolic boolean manipulation with ordered binary-decision diagrams
4. Symbolic model checking for sequential circuit verification
5. Automatic verification of finite-state concurrent systems using temporal logic specifications
6. Equational binary decision diagrams
7. MORE: Alternative implementation of BDD packages by multi-operand synthesis
8. Unlimp: Uniqueness as a leitmotiv for implementation
9. Term rewriting systems
10. Difference decision diagrams
11. Term graph rewriting
12. Binary decision diagrams by shared rewriting
13. Branching programs and binary decision diagrams
14. Decision trees: Equivalence and propositional operations
15. Sizes of ordered decision trees