Specification of Decision Diagram Operations - Archive ouverte HAL Access content directly
Conference Papers Year :

Specification of Decision Diagram Operations

Alexandre Hamez
  • Function : Author
Steve Hostettler
  • Function : Author
Alban Linard
  • Function : Author
Alexis Marechal
  • Function : Author
Emmanuel Paviot-Adet
  • Function : Author
  • PersonId : 971651
Matteo Risoldi
  • Function : Author


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.
No file

Dates and versions

hal-01293792 , version 1 (25-03-2016)


  • 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⟩
70 View
0 Download


Gmail Facebook Twitter LinkedIn More