spot  1.2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Types | Public Member Functions | List of all members
spot::ta_explicit Class Reference

#include <ta/taexplicit.hh>

Inheritance diagram for spot::ta_explicit:
Inheritance graph
Collaboration diagram for spot::ta_explicit:
Collaboration graph

Public Types

typedef std::set< state
*, state_ptr_less_than
states_set_t
 

Public Member Functions

 ta_explicit (const tgba *tgba, bdd all_acceptance_conditions, state_ta_explicit *artificial_initial_state=0, bool own_tgba=false)
 
const tgbaget_tgba () const
 
state_ta_explicitadd_state (state_ta_explicit *s)
 
void add_to_initial_states_set (state *s, bdd condition=bddfalse)
 
void create_transition (state_ta_explicit *source, bdd condition, bdd acceptance_conditions, state_ta_explicit *dest, bool add_at_beginning=false)
 
void delete_stuttering_transitions ()
 
virtual const states_set_t get_initial_states_set () const
 Get the initial states set of the automaton. More...
 
virtual ta_succ_iteratorsucc_iter (const spot::state *s) const
 Get an iterator over the successors of state. More...
 
virtual ta_succ_iteratorsucc_iter (const spot::state *s, bdd condition) const
 Get an iterator over the successors of state filtred by the changeset on transitions. More...
 
virtual bdd_dictget_dict () const
 Get the dictionary associated to the automaton. More...
 
virtual std::string format_state (const spot::state *s) const
 Format the state as a string for printing. More...
 
virtual bool is_accepting_state (const spot::state *s) const
 Return true if s is a Buchi-accepting state, otherwise false. More...
 
virtual bool is_livelock_accepting_state (const spot::state *s) const
 Return true if s is a livelock-accepting state , otherwise false. More...
 
virtual bool is_initial_state (const spot::state *s) const
 Return true if s is an initial state, otherwise false. More...
 
virtual bdd get_state_condition (const spot::state *s) const
 Return a BDD condition that represents the valuation of atomic propositions in the state s. More...
 
virtual void free_state (const spot::state *s) const
 Release a state s. More...
 
spot::stateget_artificial_initial_state () const
 Get the artificial initial state set of the automaton. Return 0 if this artificial state is not implemented (in this case, use get_initial_states_set) The aim of adding this state is to have an unique initial state. This artificial initial state have one transition to each real initial state, and this transition is labeled by the corresponding initial condition. (For more details, see the paper cited above) More...
 
void set_artificial_initial_state (state_ta_explicit *s)
 
virtual void delete_stuttering_and_hole_successors (spot::state *s)
 
ta::states_set_t get_states_set ()
 
bdd all_acceptance_conditions () const
 Return the set of all acceptance conditions used by this automaton. More...
 

Detailed Description

Explicit representation of a spot::ta.

Member Function Documentation

bdd spot::ta_explicit::all_acceptance_conditions ( ) const
inlinevirtual

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::ta.

virtual std::string spot::ta_explicit::format_state ( const spot::state s) const
virtual

Format the state as a string for printing.

This formating is the responsability of the automata that owns the state.

Implements spot::ta.

virtual void spot::ta_explicit::free_state ( const spot::state s) const
virtual

Release a state s.

Implements spot::ta.

spot::state* spot::ta_explicit::get_artificial_initial_state ( ) const
inlinevirtual

Get the artificial initial state set of the automaton. Return 0 if this artificial state is not implemented (in this case, use get_initial_states_set) The aim of adding this state is to have an unique initial state. This artificial initial state have one transition to each real initial state, and this transition is labeled by the corresponding initial condition. (For more details, see the paper cited above)

Reimplemented from spot::ta.

virtual bdd_dict* spot::ta_explicit::get_dict ( ) const
virtual

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::ta.

virtual const states_set_t spot::ta_explicit::get_initial_states_set ( ) const
virtual

Get the initial states set of the automaton.

Implements spot::ta.

virtual bdd spot::ta_explicit::get_state_condition ( const spot::state s) const
virtual

Return a BDD condition that represents the valuation of atomic propositions in the state s.

Implements spot::ta.

virtual bool spot::ta_explicit::is_accepting_state ( const spot::state s) const
virtual

Return true if s is a Buchi-accepting state, otherwise false.

Implements spot::ta.

virtual bool spot::ta_explicit::is_initial_state ( const spot::state s) const
virtual

Return true if s is an initial state, otherwise false.

Implements spot::ta.

virtual bool spot::ta_explicit::is_livelock_accepting_state ( const spot::state s) const
virtual

Return true if s is a livelock-accepting state , otherwise false.

Implements spot::ta.

virtual ta_succ_iterator* spot::ta_explicit::succ_iter ( const spot::state state) const
virtual

Get an iterator over the successors of state.

The iterator has been allocated with new. It is the responsability of the caller to delete it when no longer needed.

Implements spot::ta.

virtual ta_succ_iterator* spot::ta_explicit::succ_iter ( const spot::state state,
bdd  changeset 
) const
virtual

Get an iterator over the successors of state filtred by the changeset on transitions.

The iterator has been allocated with new. It is the responsability of the caller to delete it when no longer needed.

Implements spot::ta.


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 Thu May 15 2014 11:04:11 for spot by doxygen 1.8.4