spot 2.2.2

- Main Page
- Related Pages
- Modules
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 1 2 3 4 5]

C spot::acc_cond |
C spot::acc_cond::acc_word |
C spot::internal::all_trans< Graph > |
C spot::automaton_parser_options |
C spot::automaton_stream_parser | Parse a stream of automata
C spot::barand< gen > | Compute pseudo-random integer value between 0 and n included, following a binomial distribution with probability p
C hoayy::parser::basic_symbol< by_state > |
C tlyy::parser::basic_symbol< by_state > |
C spot::bdd_dict | Map BDD variables to formulae
C spot::bdd_dict::bdd_info |
C spot::bfs_steps | Make a BFS in a spot::tgba to compute a twa_run::steps
►C binary_function |
C spot::bdd_less_than | Comparison functor for BDDs
C spot::char_ptr_less_than | Strict Weak Ordering for `char*`
C spot::bitvect | A bit vector
C spot::bitvect_array |
C spot::internal::boxed_label< Data, boxed > |
C hoayy::parser::by_type | Type access provider for token (enum) based symbols
C tlyy::parser::by_type | Type access provider for token (enum) based symbols
C spot::clause_counter |
C spot::scc_stack_ta::connected_component |
C spot::scc_stack::connected_component |
C spot::couvreur99_check_status | The status of the emptiness-check on success
►C Data |
C spot::internal::boxed_label< Data, false > |
C spot::enumerate_cycles::dfs_entry |
C spot::digraph< State_Data, Edge_Data, Alternating > | A directed graph
C spot::digraph< kripke_graph_state, void > |
►C Edge_Data |
C spot::internal::edge_storage< StateIn, StateOut, Edge, Edge_Data > |
C spot::emptiness_check_instantiator | Dynamically create emptiness checks. Given their name and options
►C spot::emptiness_check_result | The result of an emptiness check
C spot::couvreur99_check_result | Compute a counter example from a spot::couvreur99_check_status
►C enable_shared_from_this |
►C spot::emptiness_check | Common interface to emptiness check algorithms
►C spot::couvreur99_check | An implementation of the Couvreur99 emptiness-check algorithm
C spot::couvreur99_check_shy | A version of spot::couvreur99_check that tries to visit known states first
►C spot::twa | A Transition-based ω-Automaton
►C spot::fair_kripke | Interface for a Fair Kripke structure
►C spot::kripke | Interface for a Kripke structure
C spot::kripke_graph | Kripke Structure
►C spot::taa_tgba | A self-loop Transition-based Alternating Automaton (TAA) which is seen as a TGBA (abstract class, see below)
C spot::taa_tgba_labelled< label > |
►C spot::taa_tgba_labelled< formula > |
C spot::taa_tgba_formula |
►C spot::taa_tgba_labelled< std::string > |
C spot::taa_tgba_string |
►C spot::tgta | A Transition-based Generalized Testing Automaton (TGTA)
C spot::tgta_explicit |
C spot::twa_graph |
►C spot::twa_product | A lazy product. (States are computed on the fly.)
C spot::tgta_product | A lazy product. (States are computed on the fly.)
C spot::twa_product_init | A lazy product with different initial states
C spot::enumerate_cycles | Enumerate elementary cycles in a SCC
►C spot::environment | An environment that describes atomic propositions
C spot::declarative_environment | A declarative environment
C spot::default_environment | A laxist environment
C spot::exclusive_ap |
C spot::internal::first_is_base_of< Of, Args > |
C spot::internal::first_is_base_of< Of, Arg1, Args...> |
C spot::fixed_size_pool | A fixed-size memory pool implementation
C spot::fnode | Actual storage for formula nodes
►C spot::formater |
C spot::stat_printer | Prints various statistics about a TGBA
C spot::formula | Main class for temporal logic formula
C spot::formula::formula_child_iterator | Allow iterating over children
C spot::formula_ptr_less_than_bool_first |
C std::hash< spot::acc_cond::mark_t > |
C std::hash< spot::formula > |
C spot::hoa_abort |
C spot::isomorphism_checker | Check if two automata are isomorphic
►C iterator |
C spot::internal::all_edge_iterator< Graph > |
►C spot::internal::edge_iterator< Graph > |
C spot::internal::killer_edge_iterator< Graph > |
C spot::language_containment_checker | Check containment between LTL formulae
C spot::ltsmin_model |
C spot::acc_cond::mark_t |
C spot::mark_tools |
C spot::minato_isop | Generate an irredundant sum-of-products (ISOP) form of a BDD function
C minmax_t |
C spot::multiple_size_pool | A multiple-size memory pool implementation
C spot::named_graph< Graph, State_Name, Name_Hash, Name_Equal > |
C spot::random_formula::op_proba |
C spot::option_map | Manage a map of options
C spot::pair_hash |
C spot::parsed_aut | Result of the automaton parser
C spot::parsed_formula | The result of a formula parser
C tlyy::parser | A Bison parser
C hoayy::parser | A Bison parser
►C spot::postprocessor | Wrap TGBA/BA/Monitor post-processing algorithms in an easy interface
C spot::translator | Translate an LTL formula into an optimized spot::tgba
C spot::power_map |
►C spot::printable |
C spot::printable_value< double > |
►C spot::printable_value< formula > |
C spot::printable_formula |
C spot::printable_value< std::string > |
C spot::printable_value< unsigned > |
C spot::printable_id | The default callback simply writes "%c"
C spot::printable_percent | Called by default for "%%" and "%\0"
C spot::printable_scc_info |
C spot::printable_value< T > |
►C spot::temporary_file | Temporary file name
C spot::open_temporary_file | Open temporary file
C hoayy_support::result_::prop_info |
C spot::twa::prop_set | A structure for selecting a set of automaton properties to copy
C spot::randltlgenerator |
►C spot::random_formula | Base class for random formula generators
C spot::random_boolean | Generate random Boolean formulae
►C spot::random_ltl | Generate random LTL formulae
C spot::random_psl | Generate random PSL formulae
C spot::random_sere | Generate random SERE
C spot::remove_ap |
C hoayy_support::result_ |
►C runtime_error |
C hoayy::parser::syntax_error | Syntax errors thrown from user actions
C spot::parse_error |
C tlyy::parser::syntax_error | Syntax errors thrown from user actions
C spot::satsolver | Interface with a SAT solver
C spot::scc_info |
C spot::scc_info::scc_node |
C spot::scc_stack |
C spot::scc_stack_ta |
C hoayy::parser::semantic_type | Symbol semantic values
C tlyy::parser::semantic_type | Symbol semantic values
C hoayy::slice< T, S > | Present a slice of the top of a stack
C tlyy::slice< T, S > | Present a slice of the top of a stack
C hoayy::stack< T, S > |
C tlyy::stack< T, S > |
C tlyy::stack< stack_symbol_type > |
C hoayy::stack< stack_symbol_type > |
C spot::twa_reachable_iterator_depth_first::stack_item |
►C spot::state | Abstract class for states
C spot::kripke_graph_state | Concrete class for kripke_graph states
C spot::set_state | Set of states deriving from spot::state
C spot::state_product | A state for spot::twa_product
C spot::state_ta_explicit |
C spot::state_ta_product | A state for spot::ta_product
C spot::twa_graph_state |
►C State_Data |
C spot::internal::distate_storage< Edge, State_Data > |
C hoayy_support::result_::state_info |
C spot::enumerate_cycles::state_info |
C spot::internal::state_out< Graph > |
C spot::state_ptr_equal | An Equivalence Relation for `state*`
C spot::state_ptr_hash | Hash Function for `state*`
C spot::state_ptr_less_than | Strict Weak Ordering for `state*`
C spot::state_shared_ptr_equal | An Equivalence Relation for `shared_state` (shared_ptr<const state*>)
C spot::state_shared_ptr_hash | Hash Function for `shared_state` (shared_ptr<const state*>)
C spot::state_shared_ptr_less_than | Strict Weak Ordering for `shared_state` (shared_ptr<const state*>)
C spot::state_unicity_table | Render state pointers unique via a hash table
C spot::twa_run::step |
C spot::stopwatch | A simple stopwatch
C spot::internal::succ_iterator | Helper structure to iterate over the successor of a state using the on-the-fly interface
C spot::couvreur99_check_shy::successor |
►C spot::ta | A Testing Automaton
C spot::ta_explicit |
C spot::ta_product | A lazy product between a Testing automaton and a Kripke structure. (States are computed on the fly.)
►C spot::ta_reachable_iterator | Iterate over all reachable states of a spot::ta
C spot::ta_reachable_iterator_breadth_first | An implementation of spot::ta_reachable_iterator that browses states breadth first
C spot::ta_reachable_iterator_depth_first | An implementation of spot::ta_reachable_iterator that browses states depth first
C spot::ta_statistics |
C spot::time_info | A structure to record elapsed time in clock ticks
C spot::timer |
C spot::timer_map | A map of timer, where each timer has a name
C spot::tl_simplifier | Rewrite or simplify f in various ways
C spot::tl_simplifier_options |
C spot::couvreur99_check_shy::todo_item |
C hoayy::parser::token | Tokens
C tlyy::parser::token | Tokens
C spot::state_ta_explicit::transition | Explicit transitions
C spot::taa_tgba::transition | Explicit transitions
C spot::trival | A class implementing Kleene's three-valued logic
►C tuple |
C spot::internal::boxed_label< void, true > |
C spot::twa_graph_edge_data |
►C spot::twa_reachable_iterator | Iterate over all reachable states of a spot::tgba
C spot::twa_reachable_iterator_breadth_first | An implementation of spot::twa_reachable_iterator that browses states breadth first
►C spot::twa_reachable_iterator_depth_first | Iterate over all states of an automaton using a DFS
C spot::twa_reachable_iterator_depth_first_stack | Iterate over all states of an automaton using a DFS
C spot::twa_run | An accepted run, for a twa
►C spot::twa_statistics |
C spot::twa_sub_statistics |
C spot::internal::twa_succ_iterable | Helper class to iterate over the successor of a state using the on-the-fly interface
►C spot::twa_succ_iterator | Iterate over the successors of a state
C spot::fair_kripke_succ_iterator | Iterator code for a Fair Kripke structure
►C spot::kripke_succ_iterator | Iterator code for Kripke structure
C spot::kripke_graph_succ_iterator< Graph > |
►C spot::ta_succ_iterator | Iterate over the successors of a state
C spot::ta_explicit_succ_iterator | Successor iterators used by spot::ta_explicit
►C spot::ta_succ_iterator_product | Iterate over the successors of a product computed on the fly
C spot::ta_succ_iterator_product_by_changeset |
C spot::taa_succ_iterator |
C spot::tgta_succ_iterator_product | Iterate over the successors of a product computed on the fly
C spot::twa_graph_succ_iterator< Graph > |
C spot::twa_word | An infinite word stored as a lasso
C spot::unabbreviator | Clone and rewrite a formula to remove specified operators logical operators
►C unary_function |
C spot::bdd_hash | Hash functor for BDDs
C spot::identity_hash< T > | A hash function that returns identity
C spot::ptr_hash< T > | A hash function for pointers
►C spot::unsigned_statistics |
►C spot::ars_statistics | Accepting Run Search statistics
►C spot::acss_statistics | Accepting Cycle Search Space statistics
C spot::couvreur99_check_result | Compute a counter example from a spot::couvreur99_check_status
►C spot::ec_statistics | Emptiness-check statistics
C spot::couvreur99_check | An implementation of the Couvreur99 emptiness-check algorithm
C spot::ta_check | An implementation of the emptiness-check algorithm for a product between a TA and a Kripke structure
C spot::unsigned_statistics_copy | Comparable statistics
►C vector |
C spot::acc_cond::acc_code |
►C Base |
C hoayy::parser::basic_symbol< Base > |
C tlyy::parser::basic_symbol< Base > |

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.