#include <reductgba_sim.hh>
Inheritance diagram for spot::parity_game_graph_delayed:
Public Member Functions | |
parity_game_graph_delayed (const tgba *a) | |
~parity_game_graph_delayed () | |
virtual simulation_relation * | get_relation () |
void | print (std::ostream &os) |
virtual void | add_state (const state *s) |
virtual const state * | next_state () |
Called by run() to obtain the. | |
void | run () |
Iterate over all reachable states of a spot::tgba. | |
Protected Types | |
typedef Sgi::hash_map< const state *, int, state_ptr_hash, state_ptr_equal > | seen_map |
Protected Member Functions | |
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. | |
Private Types | |
typedef Sgi::vector< bdd > | bdd_v |
Private Member Functions | |
int | nb_set_acc_cond () |
Return the number of acceptance condition. | |
void | build_sub_set_acc_cond () |
Compute sub_set_acc_cond_;. | |
duplicator_node_delayed * | add_duplicator_node_delayed (const spot::state *sn, const spot::state *dn, bdd acc, bdd label, int nb) |
spoiler_node_delayed * | add_spoiler_node_delayed (const spot::state *sn, const spot::state *dn, bdd acc, int nb) |
virtual void | build_graph () |
Compute the couple as for direct simulation,. | |
void | build_recurse_successor_spoiler (spoiler_node *sn, std::ostringstream &os) |
void | build_recurse_successor_duplicator (duplicator_node *dn, spoiler_node *sn, std::ostringstream &os) |
virtual void | lift () |
The Jurdzinski's lifting algorithm. | |
Private Attributes | |
bdd_v | sub_set_acc_cond_ |
|
Vector which contain all the sub-set of the set of acceptance condition. |
|
Reimplemented in spot::tgba_reduc. |
|
|
|
|
|
|
|
|
|
Implements spot::tgba_reachable_iterator. |
|
Compute the couple as for direct simulation,.
Implements spot::parity_game_graph. |
|
|
|
|
|
Compute sub_set_acc_cond_;.
|
|
Called by run() once all states have been explored.
Reimplemented from spot::tgba_reachable_iterator. |
|
Implements spot::parity_game_graph. |
|
The Jurdzinski's lifting algorithm.
Implements spot::parity_game_graph. |
|
Return the number of acceptance condition.
|
|
Called by run() to obtain the.
Implements spot::tgba_reachable_iterator. |
|
|
|
Called by run() to process a transition.
Reimplemented from spot::tgba_reachable_iterator. |
|
Called by run() to process a state.
Reimplemented from spot::tgba_reachable_iterator. |
|
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 iterate over state. |
|
Called by run() before starting its iteration.
Reimplemented from spot::tgba_reachable_iterator. |
|
The spot::tgba to explore.
|
|
|
|
|
|
States already seen.
|
|
|
|
|
|
|
|
A queue of states yet to explore.
|