Binary Decision Diagrams

DOI10.1109/TC.1978.1675141zbMATH Open0377.94038OpenAlexW1994143452WikidataQ56158143 ScholiaQ56158143MaRDI QIDQ4156322FDOQ4156322

Authors: S. B. Akers 

Publication date: 1978

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1978.1675141

Mathematics Subject Classification ID

Cited In (only showing first 100 items - show all)

• Incorporating bounds from decision diagrams into integer programming
• Lagrangian bounds from decision diagrams
• Gate-delay-fault testability properties of multiplexor-based networks
• Probabilistic verification of Boolean functions
• Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
• Towards Parallel Boolean Functional Synthesis
• On the computational power of binary decision diagram with redundant variables.
• Functional test generation using binary decision diagrams
• Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
• Technology mapping of multi-output functions leading to the reduction of dynamic power consumption in FPGAs
• Characteristics of the maximal independent set ZDD
• State-set branching: leveraging BDDs for heuristic search
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
• Constraint programming and operations research
• Extracting co-occurrence relations from ZDDs
• On propositional definability
• Constraint-based probabilistic modeling for statistical abduction
• Reasoning with ordered binary decision diagrams
• Hardness of indentifying the minimum ordered binary decision diagram
• Efficient data structures for Boolean functions
• Algebraic decomposition of discrete functions
• Rank-based symbolic bisimulation: (and model checking)
• Optimization Bounds from Binary Decision Diagrams
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Compact representation of near-optimal integer programming solutions
• Data structures for symbolic multi-valued model-checking
• Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems
• Formal verification based on Boolean expression diagrams
• Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
• Computation of signal output probability for Boolean functions represented by OBDD
• Graph driven BDDs -- a new data structure for Boolean functions
• Computing the Tutte polynomial of a graph of moderate size
• A framework for memory efficient context-sensitive program analysis
• Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
• Probabilistic abductive logic programming using Dirichlet priors
• On the size of binary decision diagrams representing Boolean functions
• Reduction of OBDDs in linear time
• Linear temporal logic symbolic model checking
• The \(Multi\)-SAT algorithm
• A novel OBDD-based reliability evaluation algorithm for wireless sensor networks on the multicast model
• BDD-Based Symbolic Model Checking
• Graph Coloring Lower Bounds from Decision Diagrams
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
• Cooperation through social influence
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Discrete optimization with decision diagrams
• Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
• SCIP: solving constraint integer programs
• Decomposition of systems of Boolean functions determined by binary decision diagrams
• Estimating the volume of solution space for satisfiability modulo linear real arithmetic
• Ordered binary decision diagrams as knowledge-bases
• Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
• The Computational Complexity of Understanding Binary Classifier Decisions
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
• Target Cuts from Relaxed Decision Diagrams
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• Symbolic graphs: Linear solutions to connectivity related problems
• A BDD SAT solver for satisfiability testing: An industrial case study
• Forms of representation for simple games: sizes, conversions and equivalences
• Size of ordered binary decision diagrams representing threshold functions
• Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions
• A novel graphical technique for combinational logic representation and optimization
• Size of OBDD representation of 2-level redundancies functions
• Meanings of model checking
• On-the-fly informed search of non-blocking directed controllers
• Populational announcement logic (PPAL)
• Synthesis for testability: Binary Decision Diagrams
• Aspmc: new frontiers of algebraic answer set counting
• Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs
• Groebner bases based verification solution for SystemVerilog concurrent assertions
• Decision diagrams for solving a job scheduling problem under precedence constraints
• A lightweight access control scheme supporting policy hidden based on path bloom filter
• Modular supervisory control and coordination of state tree structures
• MDDs boost equation solving on discrete dynamical systems
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
• Graph coloring with decision diagrams
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• On finding the optimal BDD relaxation
• Reduced state space representation for unbounded vector state spaces
• A feature selection strategy using Markov clustering, for the optimization of brain tumor segmentation from MRI data
• Symbolic observation graph-based generation of test paths
• On the error resilience of ordered binary decision diagrams
• Quantitative fault injection analysis
• On the relation between BDDs and FDDs
• A survey on compositional algorithms for verification and synthesis in supervisory control
• Tractable representations for Boolean functional synthesis
• Non-clausal redundancy properties
• Fifty Years of Prolog and Beyond
• Chordal Networks of Polynomial Ideals
• Verifying Fairness in Quantum Machine Learning
• Migrating gradual types
• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• Transfer of Model Checking to Industrial Practice
• On the structure of counterexamples to symmetric orderings for BDD's
• Implementing Efficient All Solutions SAT Solvers
• Vectorized symbolic model checking of computation tree logic for sequential machine verification
• Binary Decision Diagrams
• SILVER -- statistical independence and leakage verification
• Learning hierarchical probabilistic logic programs

This page was built for publication: Binary Decision Diagrams

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