UPPAAL DBM Library 2.0.5 review

Download
by rbytes.net on

Difference Bound Matrices (DBMs) are efficient data structures to represent clock constraints in timed automata. They are used in

License: GPL (GNU General Public License)
File size: 0K
Developer: Alexandre David
0 stars award from rbytes.net

Difference Bound Matrices (DBMs) are efficient data structures to represent clock constraints in timed automata.

They are used in UPPAAL as the core data structure to represent time. This library features all the common operations such as up (delay, or future), down (past), general updates, different extrapolation functions, etc. on DBMs and federations.

The library also supports subtractions and methods to merge DBMs.

What's New in This Release:
Bugs have been fixed in getValuation and mergeReduce, and doxygen comments have been corrected.
New methods have been added to the API: Hooks to mingraph_t, hasZero to test if DBMs (or federations) contain the zero point, delay for points, and toString.
The structure partition_t has been drastically improved.
The operations subtractions, intersections, and "mergeReduce" have been substantially improved.
There is a new print format of DBMs and federations to be more compatible with the Ruby binding.
index_t has been renamed to cindex_t due to a conflict on Solaris.

UPPAAL DBM Library 2.0.5 search tags