|
| sba_explicit (bdd_dict *dict) |
|
virtual | ~sba_explicit () |
|
virtual bool | state_is_accepting (const spot::state *s) const |
| is s an accepting state? More...
|
|
State * | add_default_init () |
|
size_t | num_states () const |
|
transition * | create_transition (State *source, const State *dest) |
|
transition * | create_transition (const label_t &source, const label_t &dest) |
|
transition * | get_transition (const tgba_explicit_succ_iterator< State > *si) |
|
transition * | get_transition (const tgba_succ_iterator *si) |
|
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. More...
|
|
bool | has_acceptance_condition (const ltl::formula *f) const |
|
bool | has_state (const label_t &name) |
|
const State * | get_state (const label_t &name) |
| Return the state associated to a given label. More...
|
|
const label_t & | get_label (const State *s) const |
|
const label_t & | get_label (const spot::state *s) const |
|
void | complement_all_acceptance_conditions () |
|
void | merge_transitions () |
|
State * | add_state (const label_t &name) |
|
State * | set_init_state (const label_t &state) |
|
virtual State * | get_init_state () const |
| Get the initial state of the automaton. More...
|
|
virtual
tgba_explicit_succ_iterator
< State > * | succ_iter (const spot::state *state, const spot::state *global_state=0, const tgba *global_automaton=0) const |
| Get an iterator over the successors of local_state. More...
|
|
void | set_to_string_func (to_string_func_t f) |
|
to_string_func_t | get_to_string_func () const |
|
virtual std::string | format_state (const spot::state *state) const |
| Format the state as a string for printing. More...
|
|
void | add_state_alias (const label_t &alias, const label_t &real) |
|
void | copy_acceptance_conditions_of (const tgba *a) |
| Copy the acceptance conditions of a tgba. More...
|
|
void | set_acceptance_conditions (bdd acc) |
| Acceptance conditions handling. More...
|
|
void | add_acceptance_condition (transition *t, const ltl::formula *f) |
|
void | add_acceptance_conditions (transition *t, bdd f) |
|
virtual bdd | all_acceptance_conditions () const |
| Return the set of all acceptance conditions used by this automaton. More...
|
|
virtual bdd_dict * | get_dict () const |
| Get the dictionary associated to the automaton. More...
|
|
virtual bdd | neg_acceptance_conditions () const |
| Return the conjuction of all negated acceptance variables. More...
|
|
void | declare_acceptance_condition (const ltl::formula *f) |
|
bdd | get_acceptance_condition (const ltl::formula *f) |
|
bdd | support_conditions (const state *state) const |
| Get a formula that must hold whatever successor is taken. More...
|
|
bdd | support_variables (const state *state) const |
| Get the conjunctions of variables tested by the outgoing transitions of state. More...
|
|
virtual std::string | transition_annotation (const tgba_succ_iterator *t) const |
| Return a possible annotation for the transition pointed to by the iterator. More...
|
|
virtual state * | project_state (const state *s, const tgba *t) const |
| Project a state on an automaton. More...
|
|
virtual unsigned int | number_of_acceptance_conditions () const |
| The number of acceptance conditions. More...
|
|
virtual state* spot::tgba::project_state |
( |
const state * |
s, |
|
|
const tgba * |
t |
|
) |
| const |
|
virtualinherited |
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).
- Returns
- 0 if the projection fails (s is unrelated to t), or a new
state*
(the projected state) that must be destroyed by the caller.
Reimplemented in spot::tgba_union, spot::tgba_product, spot::tgba_tba_proxy, and spot::tgba_scc.
bdd spot::tgba::support_conditions |
( |
const state * |
state) | |
const |
|
inherited |
Get a formula that must hold whatever successor is taken.
- Returns
- A formula which must be verified for all successors of state.
This can be as simple as 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.
bdd spot::tgba::support_variables |
( |
const state * |
state) | |
const |
|
inherited |
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 succ_iter()
to reduce the number of successor to compute in a product.
Sub classes should implement compute_support_variables(), this function is just a wrapper that will cache the last return value for efficiency.
virtual std::string spot::tgba::transition_annotation |
( |
const tgba_succ_iterator * |
t) | |
const |
|
virtualinherited |
Return a possible annotation for the transition pointed to by the iterator.
You may decide to use annotations when building a tgba class that represents the state space of a model, for instance to indicate how the tgba transitions relate to the original model (e.g. the annotation could be the name of a PetriNet transition, or the line number of some textual formalism).
Implementing this method is optional; the default annotation is the empty string.
This method is used for instance in dotty_reachable(), and replay_tgba_run().
- Parameters
-
Reimplemented in spot::tgba_product, and spot::tgba_scc.