25 #include "ta/taproduct.hh"
26 #include "misc/optionmap.hh"
27 #include "twaalgos/emptiness_stats.hh"
36 typedef std::pair<spot::state*, ta_succ_iterator_product*> pair_state_iter;
88 typedef std::unordered_map<
const state*, int,
113 check(
bool disable_second_pass =
false,
114 bool disable_heuristic_for_livelock_detection =
false);
121 livelock_detection(
const const_ta_product_ptr& t);
124 virtual std::ostream&
125 print_stats(std::ostream& os)
const;
129 clear(hash_type& h, std::stack<pair_state_iter> todo, std::queue<
133 clear(hash_type& h, std::stack<pair_state_iter> todo,
139 heuristic_livelock_detection(
const state * stuttering_succ,
140 hash_type& h,
int h_livelock_root, std::set<
const state*,
143 const_ta_product_ptr
a_;
147 bool is_full_2_pass_;
Emptiness-check statistics.
Definition: emptiness_stats.hh:121
Manage a map of options.
Definition: optionmap.hh:36
An Equivalence Relation for state*.
Definition: twa.hh:140
Abstract class for states.
Definition: twa.hh:42
const_ta_product_ptr a_
The automaton.
Definition: emptinessta.hh:143
An implementation of the emptiness-check algorithm for a product between a TA and a Kripke structure...
Definition: emptinessta.hh:86
option_map o_
The options.
Definition: emptinessta.hh:144
Hash Function for state*.
Definition: twa.hh:164
Iterate over the successors of a state.
Definition: ta.hh:196
Strict Weak Ordering for state*.
Definition: twa.hh:117