spot  1.2.6
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Member Functions | List of all members
spot::saba Class Referenceabstract

A State-based Alternating (Generalized) Büchi Automaton. More...

#include <saba/saba.hh>

Inheritance diagram for spot::saba:
Inheritance graph
Collaboration diagram for spot::saba:
Collaboration graph

Public Member Functions

virtual saba_stateget_init_state () const =0
 Get the initial state of the automaton. More...
 
virtual saba_succ_iteratorsucc_iter (const saba_state *local_state) const =0
 Get an iterator over the successors of local_state. More...
 
virtual bdd_dictget_dict () const =0
 Get the dictionary associated to the automaton. More...
 
virtual std::string format_state (const saba_state *state) const =0
 Format the state as a string for printing. More...
 
virtual bdd all_acceptance_conditions () const =0
 Return the set of all acceptance conditions used by this automaton. More...
 
virtual unsigned int number_of_acceptance_conditions () const
 The number of acceptance conditions. More...
 

Detailed Description

A State-based Alternating (Generalized) Büchi Automaton.

Browsing such automaton can be achieved using two functions: get_init_state, and succ_iter. The former returns the initial state while the latter lists 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.

Member Function Documentation

virtual bdd spot::saba::all_acceptance_conditions ( ) const
pure virtual

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

virtual std::string spot::saba::format_state ( const saba_state state) const
pure virtual

Format the state as a string for printing.

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

Implemented in spot::saba_complement_tgba.

virtual bdd_dict* spot::saba::get_dict ( ) const
pure 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.

Implemented in spot::saba_complement_tgba.

virtual saba_state* spot::saba::get_init_state ( ) const
pure virtual

Get the initial state of the automaton.

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

Implemented in spot::saba_complement_tgba.

virtual unsigned int spot::saba::number_of_acceptance_conditions ( ) const
virtual

The number of acceptance conditions.

virtual saba_succ_iterator* spot::saba::succ_iter ( const saba_state local_state) const
pure virtual

Get an iterator over the successors of local_state.

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

Parameters
local_stateThe state whose successors are to be explored. This pointer is not adopted in any way by succ_iter, and it is still the caller's responsability to delete it when appropriate (this can be done during the lifetime of the iterator).

Implemented in spot::saba_complement_tgba.


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