19 #ifndef SPOT_FASTTGBAALGOS_EC_DIJKSTRA_SCC_HH
20 # define SPOT_FASTTGBAALGOS_EC_DIJKSTRA_SCC_HH
24 #include "misc/hash.hh"
25 #include "union_find.hh"
26 #include "fasttgba/fasttgba.hh"
28 #include "root_stack.hh"
29 #include "deadstore.hh"
51 std::string extra_info_csv();
66 virtual void dfs_pop();
75 enum color {Alive, Dead, Unknown};
90 long unsigned int position;
94 std::vector<pair_state_iter>
todo;
95 std::vector<const spot::fasttgba_state*> live;
125 #endif // SPOT_FASTTGBAALGOS_EC_DIJKSTRA_SCC_HH
Definition: fasttgba.hh:33
This class act as an interface for all classes.
Definition: fasttgba_state.hh:30
bool counterexample_found
the automaton that will be used for the Emptiness check
Definition: dijkstra_scc.hh:80
Abstract class for states.
Definition: state.hh:40
Definition: dijkstra_scc.hh:37
int update_cpt_
count UPDATE calls
Definition: dijkstra_scc.hh:115
Definition: dijkstra_scc.hh:86
color
The color for a new State.
Definition: dijkstra_scc.hh:75
A simple wrapper for an automaton.
Definition: ec.hh:40
Sgi::hash_map< const fasttgba_state *, int, fasttgba_state_ptr_hash, fasttgba_state_ptr_equal > seen_map
the storage
Definition: dijkstra_scc.hh:106
Definition: root_stack.hh:35
Iterate over the successors of a state.
Definition: fasttgba_succ_iterator.hh:35
int update_loop_cpt_
count UPDATE loop iterations
Definition: dijkstra_scc.hh:116
Definition: fasttgba_state.hh:76
This class represents a set of acceptance marks.
Definition: markset.hh:35
This class represent a dead store. For now it's just a set but it can be combined with bitstate hasin...
Definition: deadstore.hh:41
std::vector< pair_state_iter > todo
the todo stack
Definition: dijkstra_scc.hh:94
unsigned int max_live_size_
keep peack size
Definition: dijkstra_scc.hh:113
int states_cpt_
count states
Definition: dijkstra_scc.hh:118
unsigned int max_dfs_size_
keep peack size
Definition: dijkstra_scc.hh:114
Definition: fasttgba_state.hh:88
deadstore * deadstore_
The store of dead states.
Definition: dijkstra_scc.hh:101
int transitions_cpt_
count transitions
Definition: dijkstra_scc.hh:119
int trivial_scc_
count trivial SCCs
Definition: dijkstra_scc.hh:121
int memory_cost_
evaluates memory
Definition: dijkstra_scc.hh:120
stack_of_roots * roots_stack_
Root of stack.
Definition: dijkstra_scc.hh:98
const instance_automaton * inst
The instance automaton.
Definition: dijkstra_scc.hh:110
int roots_poped_cpt_
count UPDATE loop iterations
Definition: dijkstra_scc.hh:117