def includes_trans(formula):
if formula.node_type() == SIN or \
formula.node_type == COS:
return True
else:
for arg in formula.args():
if includes_trans(arg):
return True
#no trans was found
return False
def has_ltl_operators(formula):
if formula.is_symbol():
return False
if formula.is_constant():
return False
if formula.node_type() in ALL_LTL:
return True
for child in formula.args():
if has_ltl_operators(child):
return True
return False
def walk_ltl(self, formula):
node_type = formula.node_type()
op_symbol = LTL_TYPE_TO_STR[node_type]
self.stream.write("(%s " % op_symbol)
yield formula.arg(0)
self.stream.write(")")
def encode_l(self, formula, t_i, t_k, t_l):
if formula.is_constant():
return formula
if formula.is_symbol():
assert (t_i >= 0)
return TS.get_timed(formula, t_i)
if formula.is_equals():
return self.mgr.Equals(
self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_and():
return self.mgr.And(
self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_or():
return self.mgr.Or(self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_lt():
return self.mgr.LT(self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_bv_ult():
return self.mgr.BVULT(
self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_bv_ule():
return self.mgr.BVULE(
self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_implies():
return self.mgr.Implies(
self.encode_l(formula.args()[0], t_i, t_k, t_l),
self.encode_l(formula.args()[1], t_i, t_k, t_l))
if formula.is_not():
return self.mgr.Not(self.encode_l(formula.args()[0], t_i, t_k,
t_l))
if formula.node_type() == LTL_X:
if t_i < t_k:
return self.encode_l(formula.args()[0], t_i + 1, t_k, t_l)
return self.encode_l(formula.args()[0], t_l, t_k, t_l)
if formula.node_type() == LTL_G:
return And([
self.encode_l(formula.args()[0], j, t_k, t_l)
for j in range(min(t_i, t_l), t_k + 1, 1)
])
if formula.node_type() == LTL_F:
return Or([
self.encode_l(formula.args()[0], j, t_k, t_l)
for j in range(min(t_i, t_l), t_k + 1, 1)
])
if formula.node_type() == LTL_U:
formula_h = formula.args()[0]
formula_g = formula.args()[1]
u1 = Or([And(self.encode_l(formula_g, j, t_k, t_l), \
And([self.encode_l(formula_h, n, t_k, t_l) for n in range(t_i, j, 1)])) for j in range(t_i, t_k+1, 1)])
u2 = Or([And(self.encode_l(formula_g, j, t_k, t_l), \
And([self.encode_l(formula_h, n, t_k, t_l) for n in range(t_i, t_k+1, 1)]), \
And([self.encode_l(formula_h, n, t_k, t_l) for n in range(t_l, j, 1)])) for j in range(t_l, t_i, 1)])
return Or(u1, u2)
if formula.node_type() == LTL_R:
formula_h = formula.args()[0]
formula_g = formula.args()[1]
r1 = And([
self.encode_l(formula_g, j, t_k, t_l)
for j in range(min(t_i, t_l), t_k + 1, 1)
])
r2 = Or([And(self.encode_l(formula_h, j, t_k, t_l), \
And([self.encode_l(formula_g, n, t_k, t_l) for n in range(t_i, j+1, 1)])) for j in range(t_i, t_k+1, 1)])
r3 = Or([And(self.encode_l(formula_h, j, t_k, t_l), \
And([self.encode_l(formula_g, n, t_k, t_l) for n in range(t_i, t_k+1, 1)]), \
And([self.encode_l(formula_g, n, t_k, t_l) for n in range(t_l, j+1, 1)])) for j in range(t_l, t_i, 1)])
return Or(r1, r2, r3)
if formula.node_type() == LTL_O:
return Or([
self.encode_l(formula.args()[0], j, t_k, t_l)
for j in range(t_i, t_k + 1, 1)
])
if formula.node_type() == LTL_H:
return And([
self.encode_l(formula.args()[0], j, t_k, t_l)
for j in range(t_i, t_k + 1, 1)
])
Logger.error("Invalid LTL operator")
def encode(self, formula, t_i, t_k):
if formula.is_constant():
return formula
if formula.is_symbol():
assert (t_i >= 0)
return TS.get_timed(formula, t_i)
if formula.is_equals():
return self.mgr.Equals(self.encode(formula.args()[0], t_i, t_k),
self.encode(formula.args()[1], t_i, t_k))
if formula.is_and():
return self.mgr.And(self.encode(formula.args()[0], t_i, t_k),
self.encode(formula.args()[1], t_i, t_k))
if formula.is_implies():
return self.mgr.Or(
self.mgr.Not(self.encode(formula.args()[0], t_i, t_k)),
self.encode(formula.args()[1], t_i, t_k))
if formula.is_not():
return self.mgr.Not(self.encode(formula.args()[0], t_i, t_k))
if formula.is_lt():
return self.mgr.LT(self.encode(formula.args()[0], t_i, t_k),
self.encode(formula.args()[1], t_i, t_k))
if formula.is_bv_ult():
return self.mgr.BVULT(self.encode(formula.args()[0], t_i, t_k),
self.encode(formula.args()[1], t_i, t_k))
if formula.is_bv_ule():
return self.mgr.BVULE(self.encode(formula.args()[0], t_i, t_k),
self.encode(formula.args()[1], t_i, t_k))
if formula.is_or():
return self.mgr.Or(self.encode(formula.args()[0], t_i, t_k),
self.encode(formula.args()[1], t_i, t_k))
if formula.node_type() == LTL_X:
if t_i < t_k:
return self.encode(formula.args()[0], t_i + 1, t_k)
return FALSE()
if formula.node_type() == LTL_G:
return FALSE()
if formula.node_type() == LTL_F:
return Or([
self.encode(formula.args()[0], j, t_k)
for j in range(t_i, t_k + 1, 1)
])
if formula.node_type() == LTL_U:
formula_h = formula.args()[0]
formula_g = formula.args()[1]
return Or([And(self.encode(formula_g, j, t_k), \
And([self.encode(formula_h, n, t_k) for n in range(t_i, j, 1)])) for j in range(t_i, t_k+1, 1)])
if formula.node_type() == LTL_R:
formula_h = formula.args()[0]
formula_g = formula.args()[1]
return Or([And(self.encode(formula_h, j, t_k), \
And([self.encode(formula_g, n, t_k) for n in range(t_i, j+1, 1)])) for j in range(t_i, t_k+1, 1)])
if formula.node_type() == LTL_O:
return Or([
self.encode(formula.args()[0], j, t_k)
for j in range(t_i, t_k + 1, 1)
])
if formula.node_type() == LTL_H:
return And([
self.encode(formula.args()[0], j, t_k)
for j in range(t_i, t_k + 1, 1)
])
Logger.error("Invalid LTL operator")
def walk_ltl(self, formula):
node_type = formula.node_type()
op_symbol = LTL_TYPE_TO_STR[node_type]
self.stream.write("(%s " % op_symbol)
yield formula.arg(0)
self.stream.write(")")
