#include <tgba/tgbareduc.hh>
Inheritance diagram for spot::tgba_reduc:
Public Types | |
typedef std::list< transition * > | state |
Public Member Functions | |
tgba_reduc (const tgba *a, const numbered_state_heap_factory *nshf=numbered_state_heap_hash_map_factory::instance()) | |
~tgba_reduc () | |
void | quotient_state (direct_simulation_relation *rel) |
void | quotient_state (delayed_simulation_relation *rel) |
void | delete_transitions (simulation_relation *rel) |
Delete some transitions with help of a simulation relation. | |
void | prune_scc () |
Remove all state which not lead to an accepting cycle. | |
void | prune_acc () |
Remove some useless accepting condition. | |
void | compute_scc () |
Compute the maximal SCC of the automata. | |
virtual std::string | format_state (const spot::state *state) const |
Add the SCC index to the display of the state state. | |
void | display_rel_sim (simulation_relation *rel, std::ostream &os) |
void | display_scc (std::ostream &os) |
state * | set_init_state (const std::string &state) |
transition * | create_transition (const std::string &source, const std::string &dest) |
transition * | create_transition (state *source, const state *dest) |
void | add_condition (transition *t, const ltl::formula *f) |
void | add_conditions (transition *t, bdd f) |
This assumes that all variables in f are known from dict. | |
void | declare_acceptance_condition (const ltl::formula *f) |
void | copy_acceptance_conditions_of (const tgba *a) |
Copy the acceptance conditions of a tgba. | |
bool | has_acceptance_condition (const ltl::formula *f) const |
void | add_acceptance_condition (transition *t, const ltl::formula *f) |
void | add_acceptance_conditions (transition *t, bdd f) |
This assumes that all acceptance conditions in f are known from dict. | |
void | complement_all_acceptance_conditions () |
void | merge_transitions () |
state * | add_state (const std::string &name) |
virtual spot::state * | get_init_state () const |
Get the initial state of the automaton. | |
virtual tgba_succ_iterator * | succ_iter (const spot::state *local_state, const spot::state *global_state=0, const tgba *global_automaton=0) const |
virtual tgba_succ_iterator * | succ_iter (const state *local_state, const state *global_state=0, const tgba *global_automaton=0) const =0 |
Get an iterator over the successors of local_state. | |
virtual bdd_dict * | get_dict () const |
Get the dictionary associated to the automaton. | |
virtual std::string | format_state (const state *state) const =0 |
Format the state as a string for printing. | |
virtual bdd | all_acceptance_conditions () const |
Return the set of all acceptance conditions used by this automaton. | |
virtual bdd | neg_acceptance_conditions () const |
Return the conjuction of all negated acceptance variables. | |
bdd | support_conditions (const state *state) const |
Get a formula that must hold whatever successor is taken. | |
bdd | support_variables (const state *state) const |
Get the conjunctions of variables tested by the outgoing transitions of state. | |
virtual std::string | transition_annotation (const tgba_succ_iterator *t) const |
Return a possible annotation for the transition pointed to by the iterator. | |
virtual state * | project_state (const state *s, const tgba *t) const |
Project a state on an automaton. | |
virtual int | number_of_acceptance_conditions () const |
The number of acceptance conditions. | |
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. | |
virtual void | process_state (const state *s, int n, tgba_succ_iterator *si) |
virtual void | process_link (const state *in_s, int in, const state *out_s, int out, const tgba_succ_iterator *si) |
Protected Types | |
typedef Sgi::hash_map< const tgba_explicit::state *, std::list< state * > *, ptr_hash< tgba_explicit::state > > | sp_map |
typedef Sgi::hash_map< const spot::state *, int, state_ptr_hash, state_ptr_equal > | seen_map |
typedef Sgi::hash_map< const std::string, tgba_explicit::state *, string_hash > | ns_map |
typedef Sgi::hash_map< const tgba_explicit::state *, std::string, ptr_hash< tgba_explicit::state > > | sn_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 spot::state *s, int n, tgba_succ_iterator *si) |
void | process_link (int in, int out, const tgba_succ_iterator *si) |
transition * | create_transition (const spot::state *source, const spot::state *dest) |
Create a transition using two state of a TGBA. | |
void | redirect_transition (const spot::state *s, const spot::state *simul) |
void | remove_predecessor_state (const state *s, const state *p) |
Remove p of the predecessor of s. | |
void | remove_state (const spot::state *s) |
void | merge_state (const spot::state *s1, const spot::state *s2) |
void | merge_state_delayed (const spot::state *s1, const spot::state *s2) |
void | delete_scc () |
bool | is_terminal (const spot::state *s, int n=-1) |
bool | is_not_accepting (const spot::state *s, int n=-1) |
void | remove_acc (const spot::state *s) |
void | remove_scc (spot::state *s) |
Remove all the state which belong to the same scc that s. | |
void | remove_component (const spot::state *from) |
For compute_scc. | |
int | tgba_reduc::nb_set_acc_cond () const |
virtual bdd | compute_support_conditions (const spot::state *state) const |
virtual bdd | compute_support_conditions (const state *state) const =0 |
Do the actual computation of tgba::support_conditions(). | |
virtual bdd | compute_support_variables (const spot::state *state) const |
virtual bdd | compute_support_variables (const state *state) const =0 |
Do the actual computation of tgba::support_variables(). | |
bdd | get_acceptance_condition (const ltl::formula *f) |
Protected Attributes | |
bool | scc_computed_ |
scc_stack | root_ |
numbered_state_heap * | h_ |
std::stack< const spot::state * > | state_scc_ |
Sgi::hash_map< int, const spot::state * > | state_scc_v_ |
sp_map | state_predecessor_map_ |
seen_map | si_ |
seen_map * | seen_ |
bdd | acc_ |
ns_map | name_state_map_ |
sn_map | state_name_map_ |
bdd_dict * | dict_ |
tgba_explicit::state * | init_ |
bdd | all_acceptance_conditions_ |
bdd | neg_acceptance_conditions_ |
bool | all_acceptance_conditions_computed_ |
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. |
|
|
|
Reimplemented from spot::tgba_reachable_iterator. |
|
|
|
|
|
|
|
|
|
|
|
|
|
This assumes that all acceptance conditions in f are known from dict.
|
|
|
|
This assumes that all variables in f are known from dict.
|
|
Implements spot::tgba_reachable_iterator. |
|
Return the tgba_explicit::state for name, creating the state if it does not exist. |
|
Return the set of all acceptance conditions used by this automaton. The goal of the emptiness check is to ensure that a strongly connected component walks through each of these acceptiong conditions. I.e., the union of the acceptiong conditions of all transition in the SCC should be equal to the result of this function. Implements spot::tgba. |
|
|
|
Compute the maximal SCC of the automata.
|
|
Do the actual computation of tgba::support_conditions().
Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy. |
|
|
|
Do the actual computation of tgba::support_variables().
Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy. |
|
|
|
Copy the acceptance conditions of a tgba. If used, this function should be called before creating any transition. |
|
|
|
|
|
Create a transition using two state of a TGBA.
|
|
|
|
Remove all the scc which are terminal and doesn't contains all the acceptance conditions. |
|
Delete some transitions with help of a simulation relation.
|
|
|
|
|
|
Called by run() once all states have been explored.
Reimplemented from spot::tgba_reachable_iterator. |
|
Format the state as a string for printing. This formating is the responsability of the automata who owns the state. Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy. |
|
Add the SCC index to the display of the state state.
Reimplemented from spot::tgba_explicit. |
|
|
|
Get the dictionary associated to the automaton. State are represented as BDDs. The dictionary allows to map BDD variables back to formulae, and vice versa. This is useful when dealing with several automata (which may use the same BDD variable for different formula), or simply when printing. Implements spot::tgba. |
|
Get the initial state of the automaton.
The state has been allocated with Implements spot::tgba. |
|
|
|
|
|
Return true if the scc which contains s is an fixed-formula alpha-ball. this is explain in @InProceedings{ etessami.00.concur, author = {Kousha Etessami and Gerard J. Holzmann}, title = {Optimizing {B\"u}chi Automata}, booktitle = {Proceedings of the 11th International Conference on Concurrency Theory (Concur'2000)}, pages = {153--167}, year = {2000}, editor = {C. Palamidessi}, volume = {1877}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag} } |
|
Redirect all transition leading to s1 to s2. Note that we can do the reverse because s1 and s2 belong to a co-simulate relation. |
|
Redirect all transition leading to s1 to s2. Note that we can do the reverse because s1 and s2 belong to a co-simulate relation. |
|
|
|
Return the conjuction of all negated acceptance variables.
For instance if the automaton uses variables This is useful when making products: each operand's condition set should be augmented with the neg_acceptance_conditions() of the other operand. Implements spot::tgba. |
|
Called by run() to obtain the.
Implements spot::tgba_reachable_iterator. |
|
The number of acceptance conditions.
|
|
Called by run() to process a transition.
|
|
|
|
Called by run() to process a state.
Reimplemented in spot::parity_game_graph. |
|
|
|
Project a state on an automaton. This converts s, into that corresponding spot::state for t. This is useful when you have the state of a product, and want restrict this state to a specific automata occuring in the product. It goes without saying that s and t should be compatible (i.e., s is a state of t).
Reimplemented in spot::tgba_product, and spot::tgba_tba_proxy. |
|
Remove some useless accepting condition.
|
|
Remove all state which not lead to an accepting cycle.
|
|
Build the quotient automata. Call this method when use to a delayed simulation relation. |
|
Reduce the automata using a relation simulation Do not call this method with a delayed simulation relation. |
|
Remove all the transition from the state q, predecessor of both s and simul, which can be removed. |
|
If a scc maximal do not contains all the accepting condition we can remove all the accepting condition in this scc. |
|
For compute_scc.
|
|
Remove p of the predecessor of s.
|
|
Remove all the state which belong to the same scc that s.
|
|
Remove all the transition leading to s. s is then unreachable and can be consider as remove. |
|
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. |
|
Get an iterator over the successors of local_state.
The iterator has been allocated with During synchornized products, additional informations are passed about the entire product and its state. Recall that products can be nested, forming a tree of spot::tgba where most values are computed on demand. global_automaton designate the root spot::tgba, and global_state its state. This two objects can be used by succ_iter() to restrict the set of successors to compute.
Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy. |
|
|
|
Get a formula that must hold whatever successor is taken.
bddtrue , or more completely the disjunction of the condition of all successors. This is used as an hint by succ_iter() to reduce the number of successor to compute in a product.Sub classes should implement compute_support_conditions(), this function is just a wrapper that will cache the last return value for efficiency. |
|
Get the conjunctions of variables tested by the outgoing transitions of state. All variables tested by outgoing transitions must be returned. This is mandatory.
This is used as an hint by some Sub classes should implement compute_support_variables(), this function is just a wrapper that will cache the last return value for efficiency. |
|
|
|
Return a possible annotation for the transition pointed to by the iterator. Implementing this function is optional; the default annotation it the empty string.
Reimplemented in spot::tgba_product, and spot::tgba_tba_proxy. |
|
|
|
|
|
|
|
The spot::tgba to explore.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
States already seen.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A queue of states yet to explore.
|