Open preritt opened 4 years ago
Hi @preritt,
The answer is yes, but depends on the solver. The restriction is that optimization-based solvers can find counterexamples only within convex sets, requiring that the complement of Y
must be convex. The complement of Y being Yc, that means Yc
must be convex. Therefore, your definition above would work for optimization based solvers.
On the other hand, reachability based solvers can show set membership only for convex sets. That means Y itself must be convex for them to work. So the set Yc
above is invalid for reachability methods.
We have thoughts on relaxing these restrictions, but haven't yet taken steps to implement these ideas (e.g. #67)
Hi @tomerarnon
Thanks for your reply and the reference!
Hi The tool allows constraints to be specified in the following format
What if I want multiple constraints to be satisfied simultaneously? Can
A
have multiple rows andb
be a column vector? For instance, can we have the following requirement on the outputs?Thanks!