This template class provide a sequential reachability of a kripkecube. The algorithm uses a single DFS since it is the most efficient in a sequential setting.
More...
#include <spot/mc/reachability.hh>
|
| seq_reach_kripke (kripkecube< State, SuccIterator > &sys, unsigned tid, bool &stop) |
|
Visitor & | self () |
|
void | run () |
|
unsigned int | states () |
|
unsigned int | trans () |
|
|
typedef std::unordered_map< const State, int, StateHash, StateEqual > | visited_map |
|
|
kripkecube< State, SuccIterator > & | sys_ |
|
std::vector< todo_element > | todo |
|
visited_map | visited |
|
unsigned int | dfs_number = 0 |
|
unsigned int | transitions = 0 |
|
unsigned int | tid_ |
|
bool & | stop_ |
|
template<typename State, typename SuccIterator, typename StateHash, typename StateEqual, typename Visitor>
class spot::seq_reach_kripke< State, SuccIterator, StateHash, StateEqual, Visitor >
This template class provide a sequential reachability of a kripkecube. The algorithm uses a single DFS since it is the most efficient in a sequential setting.
The documentation for this class was generated from the following file: