spot  1.0.2
Classes
Essential SABA types
SABA (State-based Alternating Büchi Automata)

Classes

class  spot::explicit_state_conjunction
 Basic implementation of saba_state_conjunction.This class provides a basic implementation to iterate over a conjunction of states of a saba. More...
class  spot::saba
 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. More...
class  spot::saba_state
 Abstract class for saba states. More...
struct  spot::saba_state_ptr_less_than
 Strict Weak Ordering for saba_state*.This is meant to be used as a comparison functor for STL map whose key are of type saba_state*. More...
struct  spot::saba_state_ptr_equal
 An Equivalence Relation for saba_state*.This is meant to be used as a comparison functor for Sgi hash_map whose key are of type saba_state*. More...
struct  spot::saba_state_ptr_hash
 Hash Function for saba_state*.This is meant to be used as a hash functor for Sgi's hash_map whose key are of type saba_state*. More...
struct  spot::saba_state_shared_ptr_less_than
 Strict Weak Ordering for shared_saba_state (shared_ptr<const saba_state*>).This is meant to be used as a comparison functor for STL map whose key are of type shared_saba_state. More...
struct  spot::saba_state_shared_ptr_equal
 An Equivalence Relation for shared_saba_state (shared_ptr<const saba_state*>).This is meant to be used as a comparison functor for Sgi hash_map whose key are of type shared_saba_state. More...
struct  spot::saba_state_shared_ptr_hash
 Hash Function for shared_saba_state (shared_ptr<const saba_state*>).This is meant to be used as a hash functor for Sgi's hash_map whose key are of type shared_saba_state. More...
class  spot::saba_state_conjunction
 Iterate over a conjunction of saba_state.This class provides the basic functionalities required to iterate over a conjunction of states of a saba. More...
class  spot::saba_succ_iterator
 Iterate over the successors of a saba_state.This class provides the basic functionalities required to iterate over the successors of a state of a saba. Since transitions of an alternating automaton are defined as a boolean function with conjunctions (universal) and disjunctions (non-deterministic),. More...

Detailed Description


Please comment this page and report errors about it on the RefDocComments page.
Generated on Wed Mar 6 2013 09:25:15 for spot by doxygen 1.8.1.2