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 142 articles )

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

1 2 3 ... 6 7 8 next

  1. Bozzano, Marco; Cimatti, Alessandro; Mattarei, Cristian: Formal reliability analysis of redundancy architectures (2019)
  2. Á. Torralba, Álvaro; López, Carlos Linares; Borrajo, Daniel: Symbolic perimeter abstraction heuristics for cost-optimal planning (2018)
  3. Bloem, Roderick; Chatterjee, Krishnendu; Jobstmann, Barbara: Graph games and reactive synthesis (2018)
  4. Čermák, Petr; Lomuscio, Alessio; Mogavero, Fabio; Murano, Aniello: Practical verification of multi-agent systems against \textscSlkspecifications (2018)
  5. Chaki, Sagar; Gurfinkel, Arie: BDD-based symbolic model checking (2018)
  6. van Benthem, Johan; van Eijck, Jan; Gattinger, Malvin; Su, Kaile: Symbolic model checking for dynamic epistemic logic -- S5 and beyond (2018)
  7. Wu, Yi-Chin; Raman, Vasumathi; Rawlings, Blake C.; Lafortune, Stéphane; Seshia, Sanjit A.: Synthesis of obfuscation policies to ensure privacy and utility (2018)
  8. 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)
  9. Dal, Giso H.; Lucas, Peter J. F.: Weighted positive binary decision diagrams for exact probabilistic inference (2017)
  10. Torralba, Álvaro; Alcázar, Vidal; Kissmann, Peter; Edelkamp, Stefan: Efficient symbolic search for cost-optimal planning (2017)
  11. John, Ajith K.; Chakraborty, Supratik: A layered algorithm for quantifier elimination from linear modular constraints (2016)
  12. Rungger, Matthias; Zamani, Majid: SCOTS: a tool for the synthesis of symbolic controllers (2016)
  13. Abujarad, Fuad; Lin, Yiyan; Bonakdarpour, Borzoo; Kulkarni, Sandeep S.: The complexity of automated addition of fault-tolerance without explicit legitimate states (2015)
  14. Ghosh, Kamalesh; Dasgupta, Pallab; Ramesh, S.: Automated planning as an early verification tool for distributed control (2015)
  15. Męski, Artur; Penczek, Wojciech; Rozenberg, Grzegorz: Model checking temporal properties of reaction systems (2015)
  16. Pang, Tao; Duan, Zhenhua; Liu, Xiaofang: A symbolic model checker for propositional projection temporal logic (2015)
  17. Shan, Laixiang; Du, Xiaomin; Qin, Zheng: Efficient approach of translating LTL formulae into Büchi automata (2015)
  18. van Benthem, Johan; van Eijck, Jan; Gattinger, Malvin; Su, Kaile: Symbolic model checking for dynamic epistemic logic (2015)
  19. Bollig, Beate: A simpler counterexample to a long-standing conjecture on the complexity of Bryant’s apply algorithm (2014)
  20. Brickenstein, Michael; Dreyer, Alexander: Gröbner-free normal forms for Boolean polynomials (2013)

1 2 3 ... 6 7 8 next


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