Swarmed variant of the CNDFS parallel emptiness-check algorithm.
More...
#include <spot/mc/cndfs.hh>
|
| | swarmed_cndfs (kripkecube< State, SuccIterator > &sys, twacube_ptr twa, shared_map &map, shared_struct *, unsigned tid, std::atomic< bool > &stop) |
| | Constructor for parallel CNDFS algorithm. More...
|
| |
| void | run () |
| | Run the algorithm. More...
|
| |
| void | setup () |
| | Setup thread resources. More...
|
| |
| std::pair< bool, product_state > | push_blue (product_state s, bool from_accepting) |
| | Push state to blue stack. More...
|
| |
| std::pair< bool, product_state > | push_red (product_state s, bool ignore_cyan) |
| | Push state to red stack. More...
|
| |
| bool | pop_blue () |
| | Pop state from blue stack. More...
|
| |
| bool | pop_red () |
| | Pop state from red stack. More...
|
| |
| void | finalize () |
| | Finalize thread resources. More...
|
| |
| bool | finisher () |
| | Check if this thread finished the search. More...
|
| |
| unsigned | states () |
| | Return number of states visited. More...
|
| |
| unsigned | transitions () |
| | Return number of transitions traversed. More...
|
| |
| unsigned | walltime () |
| | Return wall time in milliseconds. More...
|
| |
| std::string | name () |
| | Return algorithm name. More...
|
| |
| int | sccs () |
| | Return number of SCCs found (returns -1) More...
|
| |
| mc_rvalue | result () |
| | Return emptiness check result. More...
|
| |
| std::string | trace () |
| | Return trace. More...
|
| |
template<typename State, typename SuccIterator, typename StateHash, typename StateEqual>
class spot::swarmed_cndfs< State, SuccIterator, StateHash, StateEqual >
Swarmed variant of the CNDFS parallel emptiness-check algorithm.
◆ shared_map
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
| using spot::swarmed_cndfs< State, SuccIterator, StateHash, StateEqual >::shared_map = brick::hashset::FastConcurrent <product_state, state_hasher> |
Concurrent hashset for shared state storage.
◆ shared_struct
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Type alias for shared structure.
◆ swarmed_cndfs()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Constructor for parallel CNDFS algorithm.
◆ finalize()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Finalize thread resources.
◆ finisher()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Check if this thread finished the search.
◆ make_shared_structure()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Create shared structure for thread tid.
◆ name()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
◆ pop_blue()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Pop state from blue stack.
◆ pop_red()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Pop state from red stack.
◆ push_blue()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
| std::pair<bool, product_state> spot::swarmed_cndfs< State, SuccIterator, StateHash, StateEqual >::push_blue |
( |
product_state |
s, |
|
|
bool |
from_accepting |
|
) |
| |
|
inline |
Push state to blue stack.
◆ push_red()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
| std::pair<bool, product_state> spot::swarmed_cndfs< State, SuccIterator, StateHash, StateEqual >::push_red |
( |
product_state |
s, |
|
|
bool |
ignore_cyan |
|
) |
| |
|
inline |
◆ result()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
◆ run()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
◆ sccs()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Return number of SCCs found (returns -1)
◆ setup()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
◆ states()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Return number of states visited.
◆ trace()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
◆ transitions()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Return number of transitions traversed.
◆ walltime()
template<typename State , typename SuccIterator , typename StateHash , typename StateEqual >
Return wall time in milliseconds.
The documentation for this class was generated from the following file: