The following pages link to CUDD (Q16622):
Displaying 50 items.
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- GR(1)*: GR(1) specifications extended with existential guarantees (Q1982646) (← links)
- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation (Q2027854) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- DQBDD: an efficient BDD-based DQBF solver (Q2118347) (← links)
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
- Verification and enforcement of access control policies (Q2248087) (← links)
- Practical synthesis of reactive systems from LTL specifications via parity games (Q2303871) (← links)
- Performance heuristics for GR(1) synthesis and related algorithms (Q2303873) (← links)
- A symbolic algorithm for lazy synthesis of eager strategies (Q2303874) (← links)
- Automated planning as an early verification tool for distributed control (Q2352501) (← links)
- The complexity of automated addition of fault-tolerance without explicit legitimate states (Q2355327) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams (Q2372185) (← links)
- State-set branching: leveraging BDDs for heuristic search (Q2389616) (← links)
- Sequential Monte Carlo in reachability heuristics for probabilistic planning (Q2389632) (← links)
- Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice (Q2427207) (← links)
- The symbolic algorithms for maximum flow in networks (Q2433386) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- Enhancing set constraint solvers with lexicographic bounds (Q2476614) (← links)
- Improving gate-level simulation of quantum circuits (Q2573093) (← links)
- Almost ASAP semantics: from timed models to timed implementations (Q2576589) (← links)
- Exploiting interleaving semantics in symbolic state-space generation (Q2642670) (← links)
- Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
- (Q2723442) (← links)
- (Q2754101) (← links)
- (Q2769577) (← links)
- On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking (Q2891405) (← links)
- Lazy Synthesis (Q2891413) (← links)
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (Q2894267) (← links)
- Symbolic Model Checking for Temporal-Epistemic Logic (Q2900477) (← links)
- Relation Algebras, Matrices, and Multi-valued Decision Diagrams (Q2915148) (← links)
- A model-learner pattern for bayesian reasoning (Q2931816) (← links)
- SCOTS (Q2988967) (← links)
- (Q2999187) (← links)
- Precise Interprocedural Analysis in the Presence of Pointers to the Stack (Q3000594) (← links)
- Unbeast: Symbolic Bounded Synthesis (Q3000656) (← links)
- Automatic Data-Abstraction in Model Checking Multi-Agent Systems (Q3003426) (← links)
- Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic (Q3003427) (← links)
- (Q3007864) (← links)
- Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (Q3172918) (← links)
- BDD-Based Symbolic Model Checking (Q3176366) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- (Q3382224) (← links)
- Cumulative Dominance and Heuristic Performance in Binary Multiattribute Choice (Q3392248) (← links)
