Binary Decision Diagrams

DOI10.1109/TC.1978.1675141zbMath0377.94038OpenAlexW1994143452WikidataQ56158143 ScholiaQ56158143MaRDI QIDQ4156322

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

Related Items (96)

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

This page was built for publication: Binary Decision Diagrams