Parity game graph which compute the direct simulation relation. More...
#include <tgbaalgos/reductgba_sim.hh>
Public Member Functions | |
parity_game_graph_direct (const tgba *a) | |
~parity_game_graph_direct () | |
virtual direct_simulation_relation * | get_relation () |
void | print (std::ostream &os) |
virtual void | process_link (const state *in_s, int in, const state *out_s, int out, const tgba_succ_iterator *si) |
virtual void | add_state (const state *s) |
virtual const state * | next_state () |
Called by run() to obtain the next state to process. | |
void | run () |
Iterate over all reachable states of a spot::tgba. | |
virtual bool | want_state (const state *s) const |
Protected Types | |
typedef Sgi::hash_map< const state *, int, state_ptr_hash, state_ptr_equal > | seen_map |
Protected Member Functions | |
virtual void | build_graph () |
Compute each node of the graph. | |
virtual void | lift () |
Remove edge from spoiler to duplicator that make duplicator loose. Spoiler node whose still have some link, reveal a direct simulation relation. | |
void | build_link () |
void | start () |
Called by run() before starting its iteration. | |
void | end () |
Called by run() once all states have been explored. | |
void | process_state (const state *s, int n, tgba_succ_iterator *si) |
void | process_link (int in, int out, const tgba_succ_iterator *si) |
Protected Attributes | |
sn_v | spoiler_vertice_ |
dn_v | duplicator_vertice_ |
s_v | tgba_state_ |
int | nb_node_parity_game |
std::deque< const state * > | todo |
A queue of states yet to explore. | |
const tgba * | automata_ |
The spot::tgba to explore. | |
seen_map | seen |
States already seen. |
Parity game graph which compute the direct simulation relation.
typedef Sgi::hash_map<const state*, int, state_ptr_hash, state_ptr_equal> spot::tgba_reachable_iterator::seen_map [protected, inherited] |
spot::parity_game_graph_direct::parity_game_graph_direct | ( | const tgba * | a | ) |
spot::parity_game_graph_direct::~parity_game_graph_direct | ( | ) |
virtual void spot::tgba_reachable_iterator_breadth_first::add_state | ( | const state * | s | ) | [virtual, inherited] |
Implements spot::tgba_reachable_iterator.
virtual void spot::parity_game_graph_direct::build_graph | ( | ) | [protected, virtual] |
Compute each node of the graph.
Implements spot::parity_game_graph.
void spot::parity_game_graph_direct::build_link | ( | ) | [protected] |
void spot::parity_game_graph::end | ( | ) | [protected, virtual, inherited] |
Called by run() once all states have been explored.
Reimplemented from spot::tgba_reachable_iterator.
virtual direct_simulation_relation* spot::parity_game_graph_direct::get_relation | ( | ) | [virtual] |
Implements spot::parity_game_graph.
virtual void spot::parity_game_graph_direct::lift | ( | ) | [protected, virtual] |
Remove edge from spoiler to duplicator that make duplicator loose. Spoiler node whose still have some link, reveal a direct simulation relation.
Implements spot::parity_game_graph.
virtual const state* spot::tgba_reachable_iterator_breadth_first::next_state | ( | ) | [virtual, inherited] |
Called by run() to obtain the next state to process.
Implements spot::tgba_reachable_iterator.
void spot::parity_game_graph::print | ( | std::ostream & | os | ) | [inherited] |
void spot::parity_game_graph::process_link | ( | int | in, | |
int | out, | |||
const tgba_succ_iterator * | si | |||
) | [protected, inherited] |
virtual void spot::tgba_reachable_iterator::process_link | ( | const state * | in_s, | |
int | in, | |||
const state * | out_s, | |||
int | out, | |||
const tgba_succ_iterator * | si | |||
) | [virtual, inherited] |
Called by run() to process a transition.
in_s | The source state | |
in | The source state number. | |
out_s | The destination state | |
out | The destination state number. | |
si | The spot::tgba_succ_iterator positionned on the current transition. |
The in_s and out_s states are owned by the spot::tgba_reachable_iterator instance and destroyed when the instance is destroyed.
void spot::parity_game_graph::process_state | ( | const state * | s, | |
int | n, | |||
tgba_succ_iterator * | si | |||
) | [protected, virtual, inherited] |
Called by run() to process a state.
s | The current state. | |
n | A unique number assigned to s. | |
si | The spot::tgba_succ_iterator for s. |
Reimplemented from spot::tgba_reachable_iterator.
void spot::tgba_reachable_iterator::run | ( | ) | [inherited] |
Iterate over all reachable states of a spot::tgba.
This is a template method that will call add_state(), next_state(), start(), end(), process_state(), and process_link(), while it iterates over states.
void spot::parity_game_graph::start | ( | ) | [protected, virtual, inherited] |
Called by run() before starting its iteration.
Reimplemented from spot::tgba_reachable_iterator.
virtual bool spot::tgba_reachable_iterator::want_state | ( | const state * | s | ) | const [virtual, inherited] |
Called by add_state or next_states implementations to filter states. Default implementation always return true.
const tgba* spot::tgba_reachable_iterator::automata_ [protected, inherited] |
The spot::tgba to explore.
dn_v spot::parity_game_graph::duplicator_vertice_ [protected, inherited] |
int spot::parity_game_graph::nb_node_parity_game [protected, inherited] |
seen_map spot::tgba_reachable_iterator::seen [protected, inherited] |
States already seen.
sn_v spot::parity_game_graph::spoiler_vertice_ [protected, inherited] |
s_v spot::parity_game_graph::tgba_state_ [protected, inherited] |
std::deque<const state*> spot::tgba_reachable_iterator_breadth_first::todo [protected, inherited] |
A queue of states yet to explore.