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 41 to 60 of 148.
Sorted by year (citations)
  1. Yoshinaka, Ryo; Kawahara, Jun; Denzumi, Shuhei; Arimura, Hiroki; Minato, Shin-Ichi: Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (2012)
  2. Abujarad, F.; Kulkarni, S. S.: Automated constraint-based addition of nonmasking and stabilizing fault-tolerance (2011)
  3. Bryce, Daniel; Cushing, William; Kambhampati, Subbarao: State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (2011)
  4. Bulychev, P. E.: Game-theoretic simulation checking tool (2011)
  5. Cabodi, Gianpiero; Nocco, Sergio; Quer, Stefano: Benchmarking a model checker for algorithmic improvements and tuning for performance (2011)
  6. Ehlers, Rüdiger: Unbeast: symbolic bounded synthesis (2011)
  7. Holík, Lukáš; Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš: Efficient inclusion checking on explicit and semi-symbolic tree automata (2011)
  8. Huang, Xiaowei; Luo, Cheng; van der Meyden, Ron: Improved bounded model checking for a fair branching-time temporal epistemic logic (2011)
  9. Lomuscio, Alessio; Qu, Hongyang; Russo, Francesco: Automatic data-abstraction in model checking multi-agent systems (2011)
  10. Sotin, Pascal; Jeannet, Bertrand: Precise interprocedural analysis in the presence of pointers to the stack (2011)
  11. Wei, Ou; Gurfinkel, Arie; Chechik, Marsha: On the consistency, expressiveness, and precision of partial modeling formalisms (2011)
  12. Basler, Gérard; Mazzucchi, Michele; Wahl, Thomas; Kroening, Daniel: Context-aware counter abstraction (2010)
  13. Bertoli, Piergiorgio; Pistore, Marco; Traverso, Paolo: Automated composition of web services via planning in asynchronous domains (2010) ioport
  14. Berwanger, Dietmar; Chatterjee, Krishnendu; De Wulf, Martin; Doyen, Laurent; Henzinger, Thomas A.: Strategy construction for parity games with imperfect information (2010)
  15. Brickenstein, Michael: Boolean Gröbner bases. Theory, algorithms and applications (2010)
  16. Bugaychenko, D. Yu.; Soloviev, I. P.: Application of multiroot decision diagrams for integer functions (2010)
  17. Ehlers, Rüdiger; Mattmüller, Robert; Peter, Hans-Jörg: Combining symbolic representations for solving timed games (2010)
  18. Gu, Tianlong; Chang, Liang; Xu, Zhoubo: The symbolic OBDD algorithm for maximum cardinality matching in bipartite graphs (2010)
  19. Kwiatkowska, Marta; Lomuscio, Alessio; Qu, Hongyang: Parallel model checking for temporal epistemic logic (2010)
  20. Lampka, Kai; Siegle, Markus; Ossowski, Joern; Baier, Christel: Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications (2010)

Further publications can be found at: