spot  1.2.6
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Types | Public Member Functions | Protected Types | Protected Member Functions | Protected Attributes | List of all members
spot::tgba_explicit< State > Class Template Reference
Inheritance diagram for spot::tgba_explicit< State >:
Inheritance graph
Collaboration diagram for spot::tgba_explicit< State >:
Collaboration graph

Public Types

typedef State::label_t label_t
 
typedef State::label_hash_t label_hash_t
 
typedef State::transitions_t transitions_t
 
typedef State::transition transition
 
typedef State state
 
typedef std::string(* to_string_func_t )(const label_t &t)
 

Public Member Functions

 tgba_explicit (bdd_dict *dict)
 
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_dictget_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...
 

Protected Types

typedef Sgi::hash_map< label_t,
State, label_hash_t > 
ls_map
 
typedef Sgi::hash_map< label_t,
State *, label_hash_t > 
alias_map
 
typedef Sgi::hash_map< const
State *, label_t, ptr_hash
< State > > 
sl_map
 

Protected Member Functions

virtual bdd compute_support_conditions (const spot::state *in) const
 Do the actual computation of tgba::support_conditions(). More...
 
virtual bdd compute_support_variables (const spot::state *in) const
 Do the actual computation of tgba::support_variables(). More...
 

Protected Attributes

ls_map ls_
 
alias_map alias_
 
sl_map sl_
 
State * init_
 
bdd_dictdict_
 
bdd all_acceptance_conditions_
 
bool all_acceptance_conditions_computed_
 
bdd neg_acceptance_conditions_
 
to_string_func_t to_string_func_
 
const state * last_support_conditions_input_
 
const state * last_support_variables_input_
 

Member Function Documentation

void spot::explicit_graph< State, tgba >::add_acceptance_conditions ( transition *  t,
bdd  f 
)
inlineinherited

This assumes that all acceptance conditions in f are known from dict.

void spot::explicit_graph< State, tgba >::add_conditions ( transition *  t,
bdd  f 
)
inlineinherited

This assumes that all variables in f are known from dict.

State* spot::explicit_graph< State, tgba >::add_state ( const label_t &  name)
inlineinherited

Return the state_explicit for name, creating the state if it does not exist.

void spot::explicit_graph< State, tgba >::add_state_alias ( const label_t &  alias,
const label_t &  real 
)
inlineinherited

Create an alias for a state. Any reference to alias_name will act as a reference to real_name.

virtual bdd spot::explicit_graph< State, tgba >::all_acceptance_conditions ( ) const
inlinevirtualinherited

Implements spot::tgba.

virtual bdd spot::explicit_graph< State, tgba >::compute_support_conditions ( const spot::state state) const
inlineprotectedvirtualinherited

Implements spot::tgba.

virtual bdd spot::explicit_graph< State, tgba >::compute_support_variables ( const spot::state state) const
inlineprotectedvirtualinherited

Implements spot::tgba.

void spot::explicit_graph< State, tgba >::copy_acceptance_conditions_of ( const tgba a)
inlineinherited

Copy the acceptance conditions of a tgba.

If used, this function should be called before creating any transition.

References spot::tgba::neg_acceptance_conditions().

virtual std::string spot::explicit_graph< State, tgba >::format_state ( const spot::state state) const
inlinevirtualinherited

Implements spot::tgba.

virtual bdd_dict* spot::explicit_graph< State, tgba >::get_dict ( ) const
inlinevirtualinherited

Implements spot::tgba.

virtual State* spot::explicit_graph< State, tgba >::get_init_state ( ) const
inlinevirtualinherited

Implements spot::tgba.

const State* spot::explicit_graph< State, tgba >::get_state ( const label_t &  name)
inlineinherited

Return the state associated to a given label.

This is similar to add_state(), except that it returns 0 if the state does not exist.

virtual bdd spot::explicit_graph< State, tgba >::neg_acceptance_conditions ( ) const
inlinevirtualinherited

Implements spot::tgba.

virtual unsigned int spot::tgba::number_of_acceptance_conditions ( ) const
virtualinherited

The number of acceptance conditions.

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, spot::tgba_scc, and spot::tgba_proxy.

void spot::explicit_graph< State, tgba >::set_acceptance_conditions ( bdd  acc)
inlineinherited

Acceptance conditions handling.

virtual tgba_explicit_succ_iterator<State>* spot::explicit_graph< State, tgba >::succ_iter ( const spot::state local_state,
const spot::state global_state = 0,
const tgba global_automaton = 0 
) const
inlinevirtualinherited

Implements spot::tgba.

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
ta non-done tgba_succ_iterator for this automaton

Reimplemented in spot::tgba_product, spot::tgba_scc, and spot::tgba_proxy.


The documentation for this class was generated from the following file:

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Sat Dec 6 2014 12:28:44 for spot by doxygen 1.8.4