Binary Decision Diagrams: from Tree Compaction to Sampling - Sorbonne Université
Conference Papers Year : 2020

Binary Decision Diagrams: from Tree Compaction to Sampling

Abstract

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique subtree. This yields the celebrated and widely used structure called reduced ordered binary decision diagram (ROBDD). We propose to revisit the classical compaction process to give a new way of enumerating ROBDDs of a given size without considering fully expanded trees and the compaction step. Our method also provides an unranking procedure for the set of ROBDDs. As a by-product we get a random uniform and exhaustive sampler for ROBDDs for a given number of variables and size.
Fichier principal
Vignette du fichier
1907.06743v3.pdf (497.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02632657 , version 1 (20-09-2024)

Identifiers

Cite

Julien Clément, Antoine Genitrini. Binary Decision Diagrams: from Tree Compaction to Sampling. 14th Latin American Theoretical Informatics Symposium, May 2020, Sao Polo, Brazil. ⟨10.1007/978-3-030-61792-9_45⟩. ⟨hal-02632657⟩
116 View
0 Download

Altmetric

Share

More