Graph-Based Algorithms for Boolean Function Manipulation
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Representation of graphs by OBDDs
- Translation among CNFs, characteristic models and ordered binary decision diagrams
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
- Compressing probabilistic Prolog programs
- On the OBDD size for graphs of bounded tree- and clique-width
- On threshold BDDs and the optimal variable ordering problem
- The symbolic OBDD scheme for generating mechanical assembly sequences
- AND/OR search spaces for graphical models
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- STG decomposition strategies in combination with unfolding
- Automating the addition of fault tolerance with discrete controller synthesis
- Conditional independence and chain event graphs
- Minimisation of acyclic deterministic automata in linear time
- Symbolic model checking: \(10^{20}\) states and beyond
- Completeness and non-completeness results with respect to read-once projections
- Hierarchy theorems for kOBDDs and kIBDDs
- Simplification in a satisfiability checker for VLSI applications
- Reduction of OBDDs in linear time
- Occam's razor, partially specified Boolean functions, string matching, and independent sets
- An experience in proving regular networks of processes by modular model checking
- An exercise in the automatic verification of asynchronous designs
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
- Introduction to the OBDD algorithm for the ATP community
- Efficient data structures for Boolean functions
- Visualizing Boolean operations on a hypercube
- Property preserving abstractions for the verification of concurrent systems
- Using integer programming to verify general safety and liveness properties
- A rewriting approach to binary decision diagrams
- A reducibility concept for problems defined in terms of ordered binary decision diagrams
- Boolean process
- A BDD SAT solver for satisfiability testing: An industrial case study
- Size of ordered binary decision diagrams representing threshold functions
- Petri nets, traces, and local model checking
- An improved algorithm for the evaluation of fixpoint expressions
- On the non-termination of MDG-based abstract state enumeration
- Decision procedures for inductive Boolean functions based on alternating automata
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Model-checking large structured Markov chains.
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- Resolution and binary decision diagrams cannot simulate each other polynomially
- A satisfiability procedure for quantified Boolean formulae
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
- Logic programs as compact denotations.
- Binary decision diagrams for first-order predicate logic.
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- BDDs -- design, analysis, complexity, and applications.
- Symbolic state-space exploration and numerical analysis of state-sharing composed models
- Optimal ordered binary decision diagrams for read-once formulas
- Simplification of boolean verification conditions
- Automata of asynchronous behaviors
- Bypassing BDD construction for reliability analysis
- Stochastic dynamic programming with factored representations
- Time-space tradeoffs for branching programs
- Ordered binary decision diagrams as knowledge-bases
- On the evolution of the worst-case OBDD size
- Lower bounds for linearly transformed OBDDs and FBDDs
- The complexity of minimizing and learning OBDDs and FBDDs
- Constraint programming and operations research
- Randomized OBDD-based graph algorithms
- Efficient approach of translating LTL formulae into Büchi automata
- Practical verification of multi-agent systems against \textsc{Slk} specifications
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- A novel OBDD-based reliability evaluation algorithm for wireless sensor networks on the multicast model
- A theory of formal synthesis via inductive learning
- Exponential space complexity for OBDD-based reachability analysis
- Weighted positive binary decision diagrams for exact probabilistic inference
- Shield synthesis
- A unifying view on SMT-based software verification
- An explicit transition system construction approach to LTL satisfiability checking
- Extracting co-occurrence relations from ZDDs
- Model checking properties on reduced trace systems
- Outlier detection using binary decision diagrams
- Model checking temporal properties of reaction systems
- Star-topology decoupled state space search
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores
- Computation of signal output probability for Boolean functions represented by OBDD
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
- A complete adaptive algorithm for propositional satisfiability
- Boolean unification - the story so far
- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
- Hardness of indentifying the minimum ordered binary decision diagram
- On the descriptive and algorithmic power of parity ordered binary decision diagrams
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- The nonapproximability of OBDD minimization
- The small model property: How small can it be?
- Is your model checker on time? On the complexity of model checking for timed modal logics
- Symbolic model checking of timed guarded commands using difference decision diagrams
- Iterating transducers
- Syntax-directed model checking of sequential programs
- Pair-independence and freeness analysis through linear refinement.
- Ordered binary decision diagrams and the Shannon effect
- Reasoning with ordered binary decision diagrams
- An efficient algorithm for computing bisimulation equivalence
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Time of computations on linear binary graphs
- Using ordered binary decision diagrams to factorize multi-level logic
- Relation-algebraic modeling and solution of chessboard independence and domination problems
This page was built for publication: Graph-Based Algorithms for Boolean Function Manipulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724245)
