|
typedef std::unordered_map< const product_state, int, product_state_hash, product_state_equal > | visited_map |
|
|
| product_to_twa (kripkecube< State, SuccIterator > &sys, twacube_ptr twa) |
|
twa_graph_ptr | twa () |
|
void | setup () |
|
bool | push_state (product_state s, unsigned i, acc_cond::mark_t) |
|
bool | update (product_state, unsigned src, product_state, unsigned dst, acc_cond::mark_t cond) |
|
bool | counterexample_found () |
|
std::string | trace () |
|
bool | pop_state (product_state, unsigned, bool, product_state, unsigned) |
|
product_to_twa< State, SuccIterator, StateHash, StateEqual > & | self () |
| In order to implement "mixin paradigm", we must be abble to access the acual definition of the emptiness check that, in turn, has to access local variables. More...
|
|
bool | run () |
| The main function that will perform the product on-the-fly and call the emptiness check when necessary. More...
|
|
unsigned int | states () |
|
unsigned int | trans () |
|
std::string | counterexample () |
|
virtual istats | stats () |
|
|
kripkecube< State, SuccIterator > & | sys_ |
|
twacube_ptr | twa_ |
|
std::vector< todo_element > | todo |
|
visited_map | map |
|
unsigned int | dfs_number |
|
unsigned int | transitions |
|
unsigned | tid_ |
|
bool & | stop_ |
|
|
void | forward_iterators (bool just_pushed) |
| Find the first couple of iterator (from the top of the todo stack) that intersect. The parameter indicates wheter the state has just been pushed since the underlying job is slightly different. More...
|
|
◆ forward_iterators()
void spot::intersect< State, SuccIterator, StateHash, StateEqual, product_to_twa< State, SuccIterator, StateHash, StateEqual > >::forward_iterators |
( |
bool |
just_pushed | ) |
|
|
inlineprotectedinherited |
Find the first couple of iterator (from the top of the todo stack) that intersect. The parameter indicates wheter the state has just been pushed since the underlying job is slightly different.
◆ run()
The main function that will perform the product on-the-fly and call the emptiness check when necessary.
◆ self()
product_to_twa< State, SuccIterator, StateHash, StateEqual > & spot::intersect< State, SuccIterator, StateHash, StateEqual, product_to_twa< State, SuccIterator, StateHash, StateEqual > >::self |
( |
| ) |
|
|
inlineinherited |
In order to implement "mixin paradigm", we must be abble to access the acual definition of the emptiness check that, in turn, has to access local variables.
The documentation for this class was generated from the following file: