Implement alternative BDD reachability operations
There are various BDD operations that could significantly improve symbolic reachability for data-based synthesis. For example relnext, relprev, bottom-up saturation, having partial transition relations instead of only full ones, etc. Goal is to try (some of) these out to see if they improve the situation.
This involves contributions to javabdd. Therefore, the first step is to have javabdd as a plugin rather than an external dependency. Then the BDD operations can be implemented in javabdd and tried out