Skip to Main content Skip to Navigation
Conference papers

Specification of Decision Diagram Operations

Abstract : Decision Diagrams (DDs) are a well populated family of data structures, used for efficient representation and manipulation of huge data sets. Typically a given application requires choosing one particular category of DDs, like Binary Decision Diagrams (BDDs) or Data Decision Diagrams (DDDs), and sticking with it. Each category provides a language to specify its operations. For instance, the operation language of BDDs provides if-then-else, apply, etc. We focus on two main kinds of operation languages: BDD-like and DDD-like. They overlap: some operations can be expressed in both kinds of languages, while others are only available in one kind. We propose in this article a critical comparison of BDD-like and DDD-like languages. From the identified problems, we also propose a unified language for DD operations. It covers both BDD-like and DDD-like languages, and even some operations that cannot be expressed in either.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Friday, March 25, 2016 - 2:36:45 PM
Last modification on : Thursday, March 21, 2019 - 1:09:30 PM


  • HAL Id : hal-01293792, version 1


Alexandre Hamez, Steve Hostettler, Alban Linard, Alexis Marechal, Emmanuel Paviot-Adet, et al.. Specification of Decision Diagram Operations. International Workshop on Scalable and Usable Model Checking for Petri Nets and other models of Concurrency (SUMo'2010 associated with Petri Nets 2010), Jun 2010, Braga, Portugal. pp.437-451. ⟨hal-01293792⟩



Record views