Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

DOI10.1134/S106423071306004XzbMATH Open1320.94114MaRDI QIDQ2017631FDOQ2017631

Authors: P. N. Bibilo 

Publication date: 23 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Recommendations

• Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• scientific article
• Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Title not available (Why is that?)
• Binary Decision Diagrams
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• Software implementation of logic functions and automata. II. Computation time of binary programs
• Ordered binary decision diagrams as knowledge-bases
• A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits

Cited In (12)

• Title not available (Why is that?)
• Approximate algorithms for minimization of binary decision diagrams on the basis of linear transformations of variables
• Hardness of indentifying the minimum ordered binary decision diagram
• ESCT minimization for incompletely specified functions
• A note on depth minimization of Boolean systems
• On the size of binary decision diagrams representing Boolean functions
• Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• Synthesis of Minimal Binary Decision Trees
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
• Minimization of Word-Level Decision Diagrams
• Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions

Uses Software

• ModelSim

This page was built for publication: Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017631)