def construct_ts():
ts = Ts(directed=True, multi=False)
ts.g = nx.grid_2d_graph(4, 3)
ts.init[(1, 1)] = 1
ts.g.add_node((0, 0), attr_dict={'prop': set(['a'])})
ts.g.add_node((3, 2), attr_dict={'prop': set(['b'])})
ts.g.add_edges_from(ts.g.edges(), weight=1)
return ts
def case2_verification(formula, ts_file):
_, dfa_inf, bdd = twtl.translate(formula, kind=DFAType.Infinity, norm=True)
logging.info('The bound of formula "%s" is (%d, %d)!', formula, *bdd)
logging.info('Translated formula "%s" to infinity DFA of size (%d, %d)!',
formula, *dfa_inf.size())
ts = Ts(directed=True, multi=False)
ts.read_from_file(ts_file)
ts.g = nx.DiGraph(ts.g)
ts.g.add_edges_from(ts.g.edges(), weight=1)
for u, v in ts.g.edges_iter():
print u, '->', v
result = verify(ts, dfa_inf)
logging.info('The result of the verification procedure is %s!', result)