CUDD

The CUDD package provides functions to manipulate Binary Decision Diagrams (BDDs) [5,3], Algebraic Decision Diagrams (ADDs) [1], and Zero-suppressed Binary Decision Diagrams (ZDDs) [12]. BDDs are used to represent switching functions; ADDs are used to represent function from to an arbitrary set. ZDDs represent switching functions like BDDs; however, they are much more efficient than BDDs when the functions to be represented are characteristic functions of cube sets, or in general, when the ON-set of the function to be represented is very sparse. They are inferior to BDDs in other cases. The package provides a large set of operations on BDDs, ADDs, and ZDDs, functions to convert BDDs into ADDs or ZDDs and vice versa, and a large assortment of variable reordering methods.


References in zbMATH (referenced in 125 articles )

Showing results 1 to 20 of 125.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Chakraborty, Supratik; Khasidashvili, Zurab; Seger, Carl-Johan H.; Gajavelly, Rajkumar; Haldankar, Tanmay; Chhatani, Dinesh; Mistry, Rakesh: Symbolic trajectory evaluation for word-level verification: theory and implementation (2017)
  2. Dal, Giso H.; Lucas, Peter J.F.: Weighted positive binary decision diagrams for exact probabilistic inference (2017)
  3. Torralba, Álvaro; Alcázar, Vidal; Kissmann, Peter; Edelkamp, Stefan: Efficient symbolic search for cost-optimal planning (2017)
  4. John, Ajith K.; Chakraborty, Supratik: A layered algorithm for quantifier elimination from linear modular constraints (2016)
  5. Rungger, Matthias; Zamani, Majid: SCOTS: a tool for the synthesis of symbolic controllers (2016)
  6. Abujarad, Fuad; Lin, Yiyan; Bonakdarpour, Borzoo; Kulkarni, Sandeep S.: The complexity of automated addition of fault-tolerance without explicit legitimate states (2015)
  7. Ghosh, Kamalesh; Dasgupta, Pallab; Ramesh, S.: Automated planning as an early verification tool for distributed control (2015)
  8. Pang, Tao; Duan, Zhenhua; Liu, Xiaofang: A symbolic model checker for propositional projection temporal logic (2015)
  9. van Benthem, Johan; van Eijck, Jan; Gattinger, Malvin; Su, Kaile: Symbolic model checking for dynamic epistemic logic (2015)
  10. Bollig, Beate: A simpler counterexample to a long-standing conjecture on the complexity of Bryant’s apply algorithm (2014)
  11. Brickenstein, Michael; Dreyer, Alexander: Gröbner-free normal forms for Boolean polynomials (2013)
  12. Cau, Antonio; Janicke, Helge; Moszkowski, Ben: Verification and enforcement of access control policies (2013)
  13. Chatterjee, Krishnendu; Henzinger, Monika; Joglekar, Manas; Shah, Nisarg: Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (2013)
  14. Gordon, Andrew D.; Aizatulin, Mihhail; Borgstrom, Johannes; Claret, Guillaume; Graepel, Thore; Nori, Aditya V.; Rajamani, Sriram K.; Russo, Claudio: A model-learner pattern for Bayesian reasoning (2013)
  15. Lv, Guanfeng; Su, Kaile; Xu, Yanyan: Cacbdd: a BDD package with dynamic cache management (2013) ioport
  16. Aarts, Fides; Heidarian, Faranak; Kuppens, Harco; Olsen, Petur; Vaandrager, Frits: Automata learning through counterexample guided abstraction refinement (2012)
  17. Atampore, Francis; Winter, Michael: Relation algebras, matrices, and multi-valued decision diagrams (2012)
  18. Berghammer, Rudolf; Bolus, Stefan: On the use of binary decision diagrams for solving problems on simple games (2012)
  19. Bloem, Roderick; Jobstmann, Barbara; Piterman, Nir; Pnueli, Amir; Sa’ar, Yaniv: Synthesis of Reactive(1) designs (2012)
  20. Bugaychenko, Dmitry: On application of multi-rooted binary decision diagrams to probabilistic model checking (2012)

1 2 3 ... 5 6 7 next


Further publications can be found at: http://vlsi.colorado.edu/~fabio/CUDD/node7.html