#include <tgba.hh>
Inheritance diagram for spot::tgba:
Public Member Functions | |
virtual | ~tgba () |
virtual state * | get_init_state () const=0 |
Get the initial state of the automaton. | |
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. | |
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 bdd_dict * | get_dict () const=0 |
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 state * | project_state (const state *s, const tgba *t) const |
Project a state on an automata. | |
virtual bdd | all_acceptance_conditions () const=0 |
Return the set of all acceptance conditions used by this automaton. | |
virtual bdd | neg_acceptance_conditions () const=0 |
Return the conjuction of all negated acceptance variables. | |
Protected Member Functions | |
tgba () | |
virtual bdd | compute_support_conditions (const state *state) const=0 |
Do the actual computation of tgba::support_conditions(). | |
virtual bdd | compute_support_variables (const state *state) const=0 |
Do the actual computation of tgba::support_variables(). | |
Private Attributes | |
const state * | last_support_conditions_input_ |
bdd | last_support_conditions_output_ |
const state * | last_support_variables_input_ |
bdd | last_support_variables_output_ |
The acronym TGBA (Transition-based Generalized Büchi Automaton) was coined by Dimitra Giannakopoulou and Flavio Lerda in "From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata". (FORTE'02)
TGBAs are transition-based, meanings their labels are put on arcs, not on nodes. They use Generalized Büchi acceptance conditions: there are several acceptance sets (of transitions), and a path can be accepted only if it traverse at least one transition of each set infinitely often.
Browsing such automaton can be achieved using two functions. get_init_state
, and succ_iter
. The former returns the initial state while the latter allows to explore the successor states of any state.
Note that although this is a transition-based automata, we never represent transitions! Transition informations are obtained by querying the iterator over the successors of a state.
|
|
|
|
|
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. Implemented in spot::tgba_bdd_concrete, spot::tgba_explicit, spot::tgba_product, and spot::tgba_tba_proxy. |
|
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. |
|
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. |
|
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. Implemented in spot::tgba_bdd_concrete, spot::tgba_explicit, spot::tgba_product, and spot::tgba_tba_proxy. |
|
Get the initial state of the automaton.
The state has been allocated with Implemented in spot::tgba_bdd_concrete, spot::tgba_explicit, spot::tgba_product, and spot::tgba_tba_proxy. |
|
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. Implemented in spot::tgba_bdd_concrete, spot::tgba_explicit, spot::tgba_product, and spot::tgba_tba_proxy. |
|
Project a state on an automata. 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. |
|
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. |
|
|
|
|
|
|
|
|