Release Notes: This release fixes some bugs, and adds the class IntListObject for exchanging integer lists between generators and algorithms, a visualization for the class StringObject. an implicit scheduling algorithm. and a generator for scheduling problems.
Release Notes: Some minor bugs have been fixed. Implicit shortest-path algorithms have been added.
Release Notes: Some minor bugs were fixed. All explicit graphs are now handled in the GML format. The generator for threshold functions now uses arbitrary precision integers to manage threshold values. Some features were added to the Implicit TFC Network Generator, and an Implicit Blow Network Generator was added, which creates explicit random graphs and turns them into implicit, large graphs by replacing original edges by layers of complete bipartite graphs.
Release Notes: Some minor bugs were fixed. Some internals of the StatBDD class were changed. A generator for functions composed of threshold functions was added. A generator for time-expanded networks was added. A converter that computes flows over time from static flows in time-expanded networks was added. A maximum flow algorithm that avoids breadth first searches by using iterative squaring was added.
Release Notes: This release make BDD visualization more flexible (to use an arbitrary number of encoding OBDD variables), changes some internals in the StatBDD class, and adds an alternate quantification method that is realized by binary synthesis operations. Experiments are now saved before a non-GUI run is aborted by a signal.
Release Notes: This release fixes some minor bugs in the KDevelop project file and changes time measuring from real time to CPU time. CPU time is calculated as the sum of the time spent executing user instructions and the time spent in operating system code on behalf of the figaro process. Real time measuring can still be activated by adding "-DFIGARO_REALTIME" to CPPFLAGS.
Release Notes: A bug in the ImplicitTestNetworkGenerator plugin was fixed. When using certain parameters N and M, the calculated upper bound for the number of network nodes was too low. This resulted in the generation of too few encoding OBDD variables.