26 #include <spot/twa/bdddict.hh>
27 #include <spot/twaalgos/powerset.hh>
31 class tl_simplifier_cache;
43 bool symb_merge =
true,
44 bool branching_postponement =
false,
45 bool fair_loop_approx =
false,
46 unsigned max_states = 0U);
64 bool incompatible_(record_* l, record_* g);
66 record_* register_formula_(
formula f);
72 bool branching_postponement_;
73 bool fair_loop_approx_;
75 trans_map_* translated_;
76 tl_simplifier_cache* c_;
77 std::unique_ptr<const output_aborter> aborter_ =
nullptr;
Check containment between LTL formulae.
Definition: contain.hh:35
void clear()
Clear the cache.
bool contained(formula l, formula g)
Check whether L(l) is a subset of L(g).
bool contained_neg(formula l, formula g)
Check whether L(l) is a subset of L(!g).
bool neg_contained(formula l, formula g)
Check whether L(!l) is a subset of L(g).
bool equal(formula l, formula g)
Check whether L(l) = L(g).
language_containment_checker(bdd_dict_ptr dict=make_bdd_dict(), bool exprop=false, bool symb_merge=true, bool branching_postponement=false, bool fair_loop_approx=false, unsigned max_states=0U)
Definition: automata.hh:27