spot  2.3.3.dev
Classes | Public Member Functions | Protected Types | Protected Attributes | List of all members
spot::seq_reach_kripke< State, SuccIterator, StateHash, StateEqual, Visitor > Class Template Reference

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>

Inheritance diagram for spot::seq_reach_kripke< State, SuccIterator, StateHash, StateEqual, Visitor >:
Inheritance graph
Collaboration diagram for spot::seq_reach_kripke< State, SuccIterator, StateHash, StateEqual, Visitor >:
Collaboration graph

Classes

struct  todo_element
 

Public Member Functions

 seq_reach_kripke (kripkecube< State, SuccIterator > &sys, unsigned tid, bool &stop)
 
Visitor & self ()
 
void run ()
 
unsigned int states ()
 
unsigned int trans ()
 

Protected Types

typedef std::unordered_map< const State, int, StateHash, StateEqual > visited_map
 

Protected Attributes

kripkecube< State, SuccIterator > & sys_
 
std::vector< todo_elementtodo
 
visited_map visited
 
unsigned int dfs_number = 0
 
unsigned int transitions = 0
 
unsigned int tid_
 
bool & stop_
 

Detailed Description

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:

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Tue Apr 18 2017 14:42:57 for spot by doxygen 1.8.13