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 List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1 2 3]

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

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