22#include <spot/twa/bdddict.hh>
23#include <spot/twaalgos/powerset.hh>
27 class tl_simplifier_cache;
40 bool symb_merge =
true,
41 bool branching_postponement =
false,
42 bool fair_loop_approx =
false,
43 unsigned max_states = 0U);
75 tl_simplifier_cache*
c_;
77 std::unique_ptr<const output_aborter> aborter_ =
nullptr;
tl_simplifier_cache * c_
Definition contain.hh:75
void clear()
Clear the cache.
trans_map_ * translated_
Translation cache.
Definition contain.hh:74
bool fair_loop_approx_
Approximate fair loops.
Definition contain.hh:72
record_ * register_formula_(formula f)
Register a formula in the translation cache.
bool contained(formula l, formula g)
Check whether L(l) is a subset of L(g).
bool branching_postponement_
Postpone branching choices.
Definition contain.hh:71
bool exprop_
Use existential properties.
Definition contain.hh:69
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 incompatible_(record_ *l, record_ *g)
Test whether two cached formulas are incompatible.
bool equal(formula l, formula g)
Check whether L(l) = L(g).
bdd_dict_ptr dict_
Dictionary used for translations.
Definition contain.hh:68
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)
bool symb_merge_
Merge symbolic states.
Definition contain.hh:70
bdd_dict_ptr make_bdd_dict()
Create a new, empty bdd_dict wrapped in a shared pointer.
Definition bdddict.hh:308
std::shared_ptr< bdd_dict > bdd_dict_ptr
Shared pointer to a bdd_dict.
Definition bdddict.hh:304
Definition automata.hh:26