Classes |
class | spot::bdd_dict |
class | spot::state |
| Abstract class for states. More...
|
struct | spot::state_ptr_less_than |
| Strict Weak Ordering for state* .This is meant to be used as a comparison functor for STL map whose key are of type state* . More...
|
struct | spot::state_ptr_equal |
| An Equivalence Relation for state* .This is meant to be used as a comparison functor for Sgi hash_map whose key are of type state* . More...
|
struct | spot::state_ptr_hash |
| Hash Function for state* .This is meant to be used as a hash functor for Sgi's hash_map whose key are of type state* . More...
|
struct | spot::state_shared_ptr_less_than |
| Strict Weak Ordering for shared_state (shared_ptr<const state*>).This is meant to be used as a comparison functor for STL map whose key are of type shared_state . More...
|
struct | spot::state_shared_ptr_equal |
| An Equivalence Relation for shared_state (shared_ptr<const state*>).This is meant to be used as a comparison functor for Sgi hash_map whose key are of type shared_state . More...
|
struct | spot::state_shared_ptr_hash |
| Hash Function for shared_state (shared_ptr<const state*>).This is meant to be used as a hash functor for Sgi's hash_map whose key are of type shared_state . More...
|
class | spot::tgba_succ_iterator |
| Iterate over the successors of a state.This class provides the basic functionalities required to iterate over the successors of a state, as well as querying transition labels. Because transitions are never explicitely encoded, labels (conditions and acceptance conditions) can only be queried while iterating over the successors. More...
|
class | spot::tgba |
| A Transition-based Generalized Büchi Automaton.The acronym TGBA (Transition-based Generalized Büchi Automaton) was coined by Dimitra Giannakopoulou and Flavio Lerda in "From States to Transitions: Improving Translation of LTL
Formulae to Büchi Automata". (FORTE'02). More...
|