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 1 to 20 of 148.
Sorted by year (citations)

1 2 3 ... 6 7 8 next

  1. Firman, Elizabeth; Maoz, Shahar; Ringert, Jan Oliver: Performance heuristics for GR(1) synthesis and related algorithms (2020)
  2. Jacobs, Swen; Sakr, Mouhammad: A symbolic algorithm for lazy synthesis of eager strategies (2020)
  3. Luttenberger, Michael; Meyer, Philipp J.; Sickert, Salomon: Practical synthesis of reactive systems from LTL specifications via parity games (2020)
  4. Bozzano, Marco; Cimatti, Alessandro; Mattarei, Cristian: Formal reliability analysis of redundancy architectures (2019)
  5. Á. Torralba, Álvaro; López, Carlos Linares; Borrajo, Daniel: Symbolic perimeter abstraction heuristics for cost-optimal planning (2018)
  6. Bloem, Roderick; Chatterjee, Krishnendu; Jobstmann, Barbara: Graph games and reactive synthesis (2018)
  7. Čermák, Petr; Lomuscio, Alessio; Mogavero, Fabio; Murano, Aniello: Practical verification of multi-agent systems against \textscSlkspecifications (2018)
  8. Chaki, Sagar; Gurfinkel, Arie: BDD-based symbolic model checking (2018)
  9. Neto, Sebastiao M.; Zárate, Luis E.; Song, Mark A. J.: Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (2018)
  10. van Benthem, Johan; van Eijck, Jan; Gattinger, Malvin; Su, Kaile: Symbolic model checking for dynamic epistemic logic -- S5 and beyond (2018)
  11. Wu, Yi-Chin; Raman, Vasumathi; Rawlings, Blake C.; Lafortune, Stéphane; Seshia, Sanjit A.: Synthesis of obfuscation policies to ensure privacy and utility (2018)
  12. 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)
  13. Dal, Giso H.; Lucas, Peter J. F.: Weighted positive binary decision diagrams for exact probabilistic inference (2017)
  14. Kutsuna, Takuro; Yamamoto, Akihiro: Outlier detection using binary decision diagrams (2017)
  15. Torralba, Álvaro; Alcázar, Vidal; Kissmann, Peter; Edelkamp, Stefan: Efficient symbolic search for cost-optimal planning (2017)
  16. John, Ajith K.; Chakraborty, Supratik: A layered algorithm for quantifier elimination from linear modular constraints (2016)
  17. Rungger, Matthias; Zamani, Majid: SCOTS: a tool for the synthesis of symbolic controllers (2016)
  18. Abujarad, Fuad; Lin, Yiyan; Bonakdarpour, Borzoo; Kulkarni, Sandeep S.: The complexity of automated addition of fault-tolerance without explicit legitimate states (2015)
  19. Ghosh, Kamalesh; Dasgupta, Pallab; Ramesh, S.: Automated planning as an early verification tool for distributed control (2015)
  20. Męski, Artur; Penczek, Wojciech; Rozenberg, Grzegorz: Model checking temporal properties of reaction systems (2015)

1 2 3 ... 6 7 8 next

Further publications can be found at: