22#include <spot/twa/bdddict.hh>
23#include <spot/twaalgos/powerset.hh>
27 class tl_simplifier_cache;
39 bool symb_merge =
true,
40 bool branching_postponement =
false,
41 bool fair_loop_approx =
false,
42 unsigned max_states = 0U);
60 bool incompatible_(record_* l, record_* g);
62 record_* register_formula_(
formula f);
68 bool branching_postponement_;
69 bool fair_loop_approx_;
71 trans_map_* translated_;
72 tl_simplifier_cache* c_;
73 std::unique_ptr<const output_aborter> aborter_ =
nullptr;
Check containment between LTL formulae.
Definition: contain.hh:31
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:26