38 lines
1.1 KiB
Python
38 lines
1.1 KiB
Python
import operator as op
|
|
|
|
from stl.utils import set_params, param_lens
|
|
from stl.boolean_eval import pointwise_sat
|
|
|
|
from lenses import lens
|
|
|
|
def binsearch(stleval, *, tol=1e-3, lo, hi, polarity):
|
|
"""Only run search if tightest robustness was positive."""
|
|
# Early termination via bounds checks
|
|
if polarity and stleval(lo):
|
|
return lo
|
|
elif not polarity and stleval(hi):
|
|
return hi
|
|
|
|
while hi - lo > tol:
|
|
mid = lo + (hi - lo) / 2
|
|
r = stleval(mid)
|
|
lo, hi = (mid, hi) if r ^ polarity else (lo, mid)
|
|
|
|
# Want satisifiable formula
|
|
return hi if polarity else lo
|
|
|
|
|
|
def lex_param_project(stl, x, *, order, polarity, ranges, tol=1e-3):
|
|
val = {var: (ranges[var][0] if not polarity[var] else ranges[var][1]) for var in order}
|
|
p_lens = param_lens(stl)
|
|
def stleval_fact(var, val):
|
|
l = lens(val)[var]
|
|
return lambda p: pointwise_sat(set_params(stl, l.set(p)))(x, 0)
|
|
|
|
for var in order:
|
|
stleval = stleval_fact(var, val)
|
|
lo, hi = ranges[var]
|
|
param = binsearch(stleval, lo=lo, hi=hi, tol=tol, polarity=polarity[var])
|
|
val[var] = param
|
|
|
|
return val
|