19 #ifndef SPOT_FASTTGBAALGOS_EC_OPT_OPT_DIJKSTRA_SCC_HH
20 # define SPOT_FASTTGBAALGOS_EC_OPT_OPT_DIJKSTRA_SCC_HH
24 #include "misc/hash.hh"
25 #include "fasttgba/fasttgba.hh"
26 #include "fasttgbaalgos/ec/ec.hh"
27 #include "fasttgbaalgos/ec/root_stack.hh"
28 #include "fasttgbaalgos/ec/deadstore.hh"
52 std::string extra_info_csv();
63 virtual void dfs_pop();
72 enum color {Alive, Dead, Unknown};
87 long unsigned int position;
91 std::vector<pair_state_iter>
todo;
92 std::vector<const spot::fasttgba_state*> live;
137 #endif // SPOT_FASTTGBAALGOS_EC_OPT_OPT_DIJKSTRA_SCC_HH
stack_of_roots * roots_stack_
Root of stack.
Definition: opt_dijkstra_scc.hh:95
unsigned int max_live_size_
keep peack size
Definition: opt_dijkstra_scc.hh:110
int memory_cost_
evaluates memory
Definition: opt_dijkstra_scc.hh:117
Definition: fasttgba.hh:33
int transitions_cpt_
count transitions
Definition: opt_dijkstra_scc.hh:116
This class act as an interface for all classes.
Definition: fasttgba_state.hh:30
bool swarm_
shall use swarming?
Definition: opt_dijkstra_scc.hh:119
Abstract class for states.
Definition: state.hh:40
bool counterexample_found
the automaton that will be used for the Emptiness check
Definition: opt_dijkstra_scc.hh:77
This is the Dijkstra SCC computation algorithm This class also include the optimisation for the live ...
Definition: opt_dijkstra_scc.hh:37
transform the previous algorithm into an emptiness check. Only refine specific methods ...
Definition: opt_dijkstra_scc.hh:124
A simple wrapper for an automaton.
Definition: ec.hh:40
Definition: root_stack.hh:35
Iterate over the successors of a state.
Definition: fasttgba_succ_iterator.hh:35
int roots_poped_cpt_
count UPDATE loop iterations
Definition: opt_dijkstra_scc.hh:114
Definition: fasttgba_state.hh:76
Sgi::hash_map< const fasttgba_state *, int, fasttgba_state_ptr_hash, fasttgba_state_ptr_equal > seen_map
the storage
Definition: opt_dijkstra_scc.hh:103
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
color
The color for a new State.
Definition: opt_dijkstra_scc.hh:72
Definition: opt_dijkstra_scc.hh:83
int update_cpt_
count UPDATE calls
Definition: opt_dijkstra_scc.hh:112
Definition: fasttgba_state.hh:88
std::vector< pair_state_iter > todo
the todo stack
Definition: opt_dijkstra_scc.hh:91
deadstore * deadstore_
The store of dead states.
Definition: opt_dijkstra_scc.hh:98
int update_loop_cpt_
count UPDATE loop iterations
Definition: opt_dijkstra_scc.hh:113
int states_cpt_
count states
Definition: opt_dijkstra_scc.hh:115
unsigned int max_dfs_size_
keep peack size
Definition: opt_dijkstra_scc.hh:111
const instance_automaton * inst
The instance automaton.
Definition: opt_dijkstra_scc.hh:107
int trivial_scc_
count trivial SCCs
Definition: opt_dijkstra_scc.hh:118