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

Showing results 21 to 40 of 148.
Sorted by year (citations)

previous 1 2 3 4 ... 6 7 8 next

  1. Pang, Tao; Duan, Zhenhua; Liu, Xiaofang: A symbolic model checker for propositional projection temporal logic (2015)
  2. Shan, Laixiang; Du, Xiaomin; Qin, Zheng: Efficient approach of translating LTL formulae into Büchi automata (2015)
  3. van Benthem, Johan; van Eijck, Jan; Gattinger, Malvin; Su, Kaile: Symbolic model checking for dynamic epistemic logic (2015)
  4. Bollig, Beate: A simpler counterexample to a long-standing conjecture on the complexity of Bryant’s apply algorithm (2014)
  5. Brickenstein, Michael; Dreyer, Alexander: Gröbner-free normal forms for Boolean polynomials (2013)
  6. Cau, Antonio; Janicke, Helge; Moszkowski, Ben: Verification and enforcement of access control policies (2013)
  7. Chatterjee, Krishnendu; Henzinger, Monika; Joglekar, Manas; Shah, Nisarg: Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (2013)
  8. 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)
  9. Lv, Guanfeng; Su, Kaile; Xu, Yanyan: Cacbdd: a BDD package with dynamic cache management (2013) ioport
  10. Aarts, Fides; Heidarian, Faranak; Kuppens, Harco; Olsen, Petur; Vaandrager, Frits: Automata learning through counterexample guided abstraction refinement (2012)
  11. Atampore, Francis; Winter, Michael: Relation algebras, matrices, and multi-valued decision diagrams (2012)
  12. Berghammer, Rudolf; Bolus, Stefan: On the use of binary decision diagrams for solving problems on simple games (2012)
  13. Bloem, Roderick; Jobstmann, Barbara; Piterman, Nir; Pnueli, Amir; Sa’ar, Yaniv: Synthesis of Reactive(1) designs (2012)
  14. Bugaychenko, Dmitry: On application of multi-rooted binary decision diagrams to probabilistic model checking (2012)
  15. Damm, Werner; Dierks, Henning; Disch, Stefan; Hagemann, Willem; Pigorsch, Florian; Scholl, Christoph; Waldmann, Uwe; Wirtz, Boris: Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (2012)
  16. Ehlers, Rüdiger: Symbolic bounded synthesis (2012)
  17. Finkbeiner, Bernd; Jacobs, Swen: Lazy synthesis (2012)
  18. Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš: VATA: a library for efficient manipulation of non-deterministic tree automata (2012)
  19. Lomuscio, Alessio; Penczek, Wojciech: Symbolic model checking for temporal-epistemic logic (2012)
  20. Toda, Takahisa: Extracting co-occurrence relations from ZDDs (2012)

previous 1 2 3 4 ... 6 7 8 next


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