spot  0.9.1
Public Types | Public Member Functions | Protected Types | Protected Member Functions | Protected Attributes | Private Member Functions
spot::sba_explicit< State > Class Template Reference

#include <tgba/tgbaexplicit.hh>

Inheritance diagram for spot::sba_explicit< State >:
Inheritance graph
[legend]
Collaboration diagram for spot::sba_explicit< State >:
Collaboration graph
[legend]

List of all members.

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

 sba_explicit (bdd_dict *dict)
virtual ~sba_explicit ()
virtual bool state_is_accepting (const spot::state *s) const
 is s an accepting state?
State * add_default_init ()
transitioncreate_transition (State *source, const State *dest)
transitioncreate_transition (const label_t &source, const label_t &dest)
transitionget_transition (const tgba_explicit_succ_iterator< State > *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.
bool has_acceptance_condition (const ltl::formula *f) const
bool has_state (const label_t &name)
const label_tget_label (const State *s) const
const label_tget_label (const spot::state *s) const
transitioncreate_trainsition (const label_t &source, const label_t &dest)
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.
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.
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.
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.
void set_acceptance_conditions (bdd acc)
 Acceptance conditions handlingx.
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.
virtual bdd_dictget_dict () const
 Get the dictionary associated to the automaton.
virtual bdd neg_acceptance_conditions () const
 Return the conjuction of all negated acceptance variables.
void declare_acceptance_condition (const ltl::formula *f)
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 stateproject_state (const state *s, const tgba *t) const
 Project a state on an automaton.
virtual unsigned int number_of_acceptance_conditions () const
 The number of acceptance conditions.

Protected Types

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

Protected Member Functions

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

Protected Attributes

ls_map ls_
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 statelast_support_conditions_input_
const statelast_support_variables_input_

Private Member Functions

 sba_explicit (const sba_explicit< State > &other)
sba_explicitoperator= (const sba_explicit &other)

template<typename State>
class spot::sba_explicit< State >


Member Typedef Documentation

typedef State::label_hash_t spot::explicit_graph< State, sba >::label_hash_t [inherited]
typedef State::label_t spot::explicit_graph< State, sba >::label_t [inherited]
typedef Sgi::hash_map<label_t, State, label_hash_t> spot::explicit_graph< State, sba >::ls_map [protected, inherited]
typedef Sgi::hash_map<const State*, label_t, ptr_hash<State> > spot::explicit_graph< State, sba >::sl_map [protected, inherited]
typedef State spot::explicit_graph< State, sba >::state [inherited]
typedef std::string(* spot::explicit_graph< State, sba >::to_string_func_t)(const label_t &t) [inherited]
typedef State::transition spot::explicit_graph< State, sba >::transition [inherited]
typedef State::transitions_t spot::explicit_graph< State, sba >::transitions_t [inherited]

Constructor & Destructor Documentation

template<typename State>
spot::sba_explicit< State >::sba_explicit ( bdd_dict dict) [inline]
template<typename State>
virtual spot::sba_explicit< State >::~sba_explicit ( ) [inline, virtual]
template<typename State>
spot::sba_explicit< State >::sba_explicit ( const sba_explicit< State > &  other) [private]

Member Function Documentation

void spot::explicit_graph< State, sba >::add_acceptance_condition ( transition t,
const ltl::formula f 
) [inline, inherited]
void spot::explicit_graph< State, sba >::add_acceptance_conditions ( transition t,
bdd  f 
) [inline, inherited]

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

void spot::explicit_graph< State, sba >::add_condition ( transition t,
const ltl::formula f 
) [inline, inherited]
void spot::explicit_graph< State, sba >::add_conditions ( transition t,
bdd  f 
) [inline, inherited]

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

State* spot::explicit_graph< State, sba >::add_default_init ( ) [inline, inherited]
State* spot::explicit_graph< State, sba >::add_state ( const label_t &  name) [inline, inherited]

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

void spot::explicit_graph< State, sba >::add_state_alias ( const label_t &  alias,
const label_t &  real 
) [inline, inherited]

old implementation in tgba_explicit_string 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, sba >::all_acceptance_conditions ( ) const [inline, virtual, inherited]

Implements spot::tgba.

void spot::explicit_graph< State, sba >::complement_all_acceptance_conditions ( ) [inline, inherited]
virtual bdd spot::explicit_graph< State, sba >::compute_support_conditions ( const spot::state state) const [inline, protected, virtual, inherited]

Implements spot::tgba.

virtual bdd spot::explicit_graph< State, sba >::compute_support_variables ( const spot::state state) const [inline, protected, virtual, inherited]

Implements spot::tgba.

void spot::explicit_graph< State, sba >::copy_acceptance_conditions_of ( const tgba a) [inline, inherited]

Copy the acceptance conditions of a tgba.

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

transition* spot::explicit_graph< State, sba >::create_trainsition ( const label_t &  source,
const label_t &  dest 
) [inline, inherited]
transition* spot::explicit_graph< State, sba >::create_transition ( State *  source,
const State *  dest 
) [inline, inherited]
transition* spot::explicit_graph< State, sba >::create_transition ( const label_t &  source,
const label_t &  dest 
) [inline, inherited]
void spot::explicit_graph< State, sba >::declare_acceptance_condition ( const ltl::formula f) [inline, inherited]
virtual std::string spot::explicit_graph< State, sba >::format_state ( const spot::state state) const [inline, virtual, inherited]

Implements spot::tgba.

bdd spot::explicit_graph< State, sba >::get_acceptance_condition ( const ltl::formula f) [inline, protected, inherited]
virtual bdd_dict* spot::explicit_graph< State, sba >::get_dict ( ) const [inline, virtual, inherited]

Implements spot::tgba.

virtual State* spot::explicit_graph< State, sba >::get_init_state ( ) const [inline, virtual, inherited]

Implements spot::tgba.

const label_t& spot::explicit_graph< State, sba >::get_label ( const State *  s) const [inline, inherited]
const label_t& spot::explicit_graph< State, sba >::get_label ( const spot::state s) const [inline, inherited]
to_string_func_t spot::explicit_graph< State, sba >::get_to_string_func ( ) const [inline, inherited]
transition* spot::explicit_graph< State, sba >::get_transition ( const tgba_explicit_succ_iterator< State > *  si) [inline, inherited]
bool spot::explicit_graph< State, sba >::has_acceptance_condition ( const ltl::formula f) const [inline, inherited]
bool spot::explicit_graph< State, sba >::has_state ( const label_t &  name) [inline, inherited]
void spot::explicit_graph< State, sba >::merge_transitions ( ) [inline, inherited]
virtual bdd spot::explicit_graph< State, sba >::neg_acceptance_conditions ( ) const [inline, virtual, inherited]

Implements spot::tgba.

virtual unsigned int spot::tgba::number_of_acceptance_conditions ( ) const [virtual, inherited]

The number of acceptance conditions.

template<typename State>
sba_explicit& spot::sba_explicit< State >::operator= ( const sba_explicit< State > &  other) [private]
virtual state* spot::tgba::project_state ( const state s,
const tgba t 
) const [virtual, inherited]

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.

void spot::explicit_graph< State, sba >::set_acceptance_conditions ( bdd  acc) [inline, inherited]

Acceptance conditions handlingx.

State* spot::explicit_graph< State, sba >::set_init_state ( const label_t &  state) [inline, inherited]
void spot::explicit_graph< State, sba >::set_to_string_func ( to_string_func_t  f) [inline, inherited]
template<typename State>
virtual bool spot::sba_explicit< State >::state_is_accepting ( const spot::state s) const [inline, virtual]
virtual tgba_explicit_succ_iterator<State>* spot::explicit_graph< State, sba >::succ_iter ( const spot::state local_state,
const spot::state global_state = 0,
const tgba global_automaton = 0 
) const [inline, virtual, inherited]
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 [virtual, inherited]

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


Member Data Documentation

bdd spot::explicit_graph< State, sba >::all_acceptance_conditions_ [mutable, protected, inherited]
bool spot::explicit_graph< State, sba >::all_acceptance_conditions_computed_ [mutable, protected, inherited]
bdd_dict* spot::explicit_graph< State, sba >::dict_ [protected, inherited]
State* spot::explicit_graph< State, sba >::init_ [protected, inherited]
const state* spot::tgba::last_support_conditions_input_ [mutable, protected, inherited]
const state* spot::tgba::last_support_variables_input_ [mutable, protected, inherited]
ls_map spot::explicit_graph< State, sba >::ls_ [protected, inherited]
bdd spot::explicit_graph< State, sba >::neg_acceptance_conditions_ [protected, inherited]
sl_map spot::explicit_graph< State, sba >::sl_ [protected, inherited]
to_string_func_t spot::explicit_graph< State, sba >::to_string_func_ [protected, inherited]

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

Please comment this page and report errors about it on the RefDocComments page.
Generated on Wed May 23 2012 12:06:46 for spot by doxygen 1.7.6.1