BDDGUI 0.4

To Do

Handling

  • Copy and Paste

Drawing

  • Better draw algorithms
In Progress
Finished

Drawing

  • Improved edge label positioning
  • Improved latex display

Print/Export

  • Margins for print/export
  • Different resolutions for print/export
  • No paperformat for export

InfoBoxes

  • Multiple line edit
  • Arrow mode

BDDGUI 0.3

To Do
In Progress
Finished

Edit-Mode

  • Implement basic editing mode to create BDDs (without editing the data file)
  • Make it possible to remove nodes and edges
  • Everything can be configured with the gui

JJS-BDD 0.2

To Do

common

  • implement minatos algorithm

SOBDD

  • bugfix linear sifting
  • implement input inverter

ADD

  • implement negative edges (1-x)
In Progress

common

  • building symmetric groups
Finished

BDDGUI

  • make node information configurable
  • LaTeX support
  • implement InfoBoxes
  • make root node information configurable
  • implement export
  • bounding box calculation

common

  • rewrite hashmaps for better memory usage
  • implement faster unique table for ADDs, SOBDDs and ZBDDs
  • remove root nodes (faster implementation)
  • garbage collection bugfixes

SOBDD

  • symmetric groups
  • major speed improvements (~50%)
  • memory usage reduction

NADD

  • improve min, max, less, ...
  • memory usage reduction

ZBDD

  • code clean up
  • runtime improvements

JJS-BDD 0.1

To Do
In Progress
Finished

common

  • rewrite varorder code
  • implement group structure
  • rewrite hashfunction to handle container objects
  • mempool (mem alloc)
  • implement function pointer class
  • implement assignments
  • genetic approach to optimize variable ordering
  • implement shift, sifting, windowpermutation (2,3,4)
  • implement computed tables for all BDD operators
  • global configuration of library (constants.h)

ADD

  • implement base classes for Algebraic Decision Diagrams (ADDs)
  • implement swap => reordering
  • implement ITE and all boolean operators
  • implement algebraic operators
  • improved standard triples

NADD

  • implement base classes for Normalized Algebraic Decision Diagrams (NADDs)
  • implement swap => reordering
  • implement ITE and all boolean operators
  • implement algebraic operators
  • improved standard triples

FEVBDDs

  • implement base classes for Factored Edge-Valued Binary Decision Diagrams (FEVBDDs)
  • implement swap => reordering
  • implement ITE and all boolean operators
  • implement algebraic operators
  • improved standard triples

ZBDD

  • implement base classes for ZBDDs
  • implement ITE and all boolean operators
  • implement swap => reordering

SOBDD

  • implement group sifting on new varorder
  • implement SOBDDFunction
  • garbage collection should handle delay (performance)
  • implement swap => reordering
  • different size-functions
  • implement compose, exists, forall
  • implement constrain, restrict
  • implement function container
  • bugfix for ITE
  • implement fast clean up
  • use standard-tripels in ITE
  • implement two level garbage-collection
  • testsuite
  • implement rename operator
  • improved standard triples

BDDGUI

  • context menu for node operations
  • save BDD
  • print screen
  • tangential drawing
  • paint nodes
  • create first simple debug gui

Output

  • save BDD (xml,binary,BDD)

Input

  • rewrite old code
  • implement plugin interface for new input format (xml,binary,blif)