#include <tgba/tgbaproduct.hh>
Inheritance diagram for spot::tgba_product:
Public Member Functions | |
tgba_product (const tgba *left, const tgba *right) | |
Constructor. | |
virtual | ~tgba_product () |
virtual state * | get_init_state () const |
Get the initial state of the automaton. | |
virtual tgba_succ_iterator_product * | succ_iter (const state *local_state, const state *global_state=0, const tgba *global_automaton=0) const |
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 |
Format the state as a string for printing. | |
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 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 int | number_of_acceptance_conditions () const |
The number of acceptance conditions. | |
Protected Member Functions | |
virtual bdd | compute_support_conditions (const state *state) const |
Do the actual computation of tgba::support_conditions(). | |
virtual bdd | compute_support_variables (const state *state) const |
Do the actual computation of tgba::support_variables(). | |
Private Member Functions | |
tgba_product (const tgba_product &) | |
tgba_product & | tgba_product::operator= (const tgba_product &) |
Private Attributes | |
bdd_dict * | dict_ |
const tgba * | left_ |
const tgba * | right_ |
bdd | left_acc_complement_ |
bdd | right_acc_complement_ |
bdd | all_acceptance_conditions_ |
bdd | neg_acceptance_conditions_ |
|
Constructor.
|
|
|
|
|
|
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. |
|
Do the actual computation of tgba::support_conditions().
Implements spot::tgba. |
|
Do the actual computation of tgba::support_variables().
Implements spot::tgba. |
|
Format the state as a string for printing. This formating is the responsability of the automata who owns the state. Implements spot::tgba. |
|
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 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. |
|
The number of acceptance conditions.
|
|
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 from spot::tgba. |
|
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.
Implements spot::tgba. |
|
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 from spot::tgba. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|