►Nhoayy | |
►Cparser | A Bison parser |
Cbasic_symbol | |
Cby_type | Type access provider for token (enum) based symbols |
Csemantic_type | Symbol semantic values |
Csyntax_error | Syntax errors thrown from user actions |
Ctoken | Tokens |
Cslice | Present a slice of the top of a stack |
Cstack | |
►Nhoayy_support | |
►Cresult_ | |
Cprop_info | |
Cstate_info | |
►Nspot | |
►Ninternal | |
Call_edge_iterator | |
Call_trans | |
Cboxed_label | |
Cboxed_label< Data, false > | |
Cboxed_label< void, true > | |
Cconst_universal_dests | |
Cdistate_storage | |
Cedge_iterator | |
Cedge_storage | |
Cfirst_is_base_of | |
Cfirst_is_base_of< Of, Arg1, Args... > | |
Ckeep_all | |
Ckeep_inner_scc | |
Ckiller_edge_iterator | |
Cmark_container | |
Cmark_iterator | |
Cscc_edge_iterator | |
Cscc_edges | |
Cstate_out | |
Csucc_iterator | Helper structure to iterate over the successor of a state using the on-the-fly interface |
Ctwa_succ_iterable | Helper class to iterate over the successor of a state using the on-the-fly interface |
Cuniv_dest_mapper | |
►Cacc_cond | |
Cacc_code | |
Cacc_word | |
Cmark_t | |
Crs_pair | Rabin/streett pairs used by is_rabin_like and is_streett_like |
Cacss_statistics | Accepting Cycle Search Space statistics |
Cars_statistics | Accepting Run Search statistics |
Cautomaton_parser_options | |
Cautomaton_stream_parser | Parse a stream of automata |
Cbarand | Compute pseudo-random integer value between 0 and n included, following a binomial distribution with probability p |
►Cbdd_dict | Map BDD variables to formulae |
Cbdd_info | |
Cbdd_hash | Hash functor for BDDs |
Cbdd_less_than | Comparison functor for BDDs |
Cbdd_less_than_stable | Comparison functor for BDDs |
Cbfs_steps | Make a BFS in a spot::tgba to compute a twa_run::steps |
Cbitvect | A bit vector |
Cbitvect_array | |
Cchar_ptr_less_than | Strict Weak Ordering for char* |
Ccouvreur99_check | An implementation of the Couvreur99 emptiness-check algorithm |
Ccouvreur99_check_result | Compute a counter example from a spot::couvreur99_check_status |
►Ccouvreur99_check_shy | A version of spot::couvreur99_check that tries to visit known states first |
Csuccessor | |
Ctodo_item | |
Ccouvreur99_check_status | The status of the emptiness-check on success |
Cdeclarative_environment | A declarative environment |
Cdefault_environment | A laxist environment |
Cdigraph | A directed graph |
Cec_statistics | Emptiness-check statistics |
Cemptiness_check | Common interface to emptiness check algorithms |
Cemptiness_check_instantiator | Dynamically create emptiness checks. Given their name and options |
Cemptiness_check_result | The result of an emptiness check |
►Cenumerate_cycles | Enumerate elementary cycles in a SCC |
Cdfs_entry | |
Cstate_info | |
Cenvironment | An environment that describes atomic propositions |
Cexclusive_ap | |
Cfair_kripke | Interface for a Fair Kripke structure |
Cfair_kripke_succ_iterator | Iterator code for a Fair Kripke structure |
Cfixed_size_pool | A fixed-size memory pool implementation |
Cfnode | Actual storage for formula nodes |
Cformater | |
►Cformula | Main class for temporal logic formula |
Cformula_child_iterator | Allow iterating over children |
Cformula_ptr_less_than_bool_first | |
Choa_abort | |
Cidentity_hash | A hash function that returns identity |
Cisomorphism_checker | Check if two automata are isomorphic |
Ckripke | Interface for a Kripke structure |
Ckripke_graph | Kripke Structure |
Ckripke_graph_state | Concrete class for kripke_graph states |
Ckripke_graph_succ_iterator | |
Ckripke_succ_iterator | Iterator code for Kripke structure |
Clanguage_containment_checker | Check containment between LTL formulae |
Cltsmin_model | |
Cmark_tools | |
Cminato_isop | Generate an irredundant sum-of-products (ISOP) form of a BDD function |
Cmultiple_size_pool | A multiple-size memory pool implementation |
Cnamed_graph | |
Cnca_st_info | |
Copen_temporary_file | Open temporary file |
Coption_map | Manage a map of options |
Cpair_hash | |
Cparity_game | |
Cparse_error | |
Cparsed_aut | Result of the automaton parser |
Cparsed_formula | The result of a formula parser |
Cpostprocessor | Wrap TGBA/BA/Monitor post-processing algorithms in an easy interface |
Cpower_map | |
Cprintable | |
Cprintable_acc_cond | |
Cprintable_formula | |
Cprintable_id | The default callback simply writes "%c" |
Cprintable_percent | Called by default for "%%" and "%\0" |
Cprintable_scc_info | |
Cprintable_value | |
Cprocess_timer | Struct used to start and stop both timer and stopwatch clocks |
Cptr_hash | A hash function for pointers |
Crandltlgenerator | |
Crandom_boolean | Generate random Boolean formulae |
►Crandom_formula | Base class for random formula generators |
Cop_proba | |
Crandom_ltl | Generate random LTL formulae |
Crandom_psl | Generate random PSL formulae |
Crandom_sere | Generate random SERE |
Creachability_game | |
Creachability_game_succ_iterator | |
Creachability_state | |
Creachability_state_hash | |
Cremove_ap | |
Crs_pairs_view | |
Csatsolver | Interface with a SAT solver |
Csatsolver_command | Interface with a given sat solver |
Cscc_info | Compute an SCC map and gather assorted information |
Cscc_info_node | Storage for SCC related information |
►Cscc_stack | |
Cconnected_component | |
►Cscc_stack_ta | |
Cconnected_component | |
Cset_state | Set of states deriving from spot::state |
Cstat_printer | Prints various statistics about a TGBA |
Cstate | Abstract class for states |
Cstate_product | A state for spot::twa_product |
Cstate_ptr_equal | An Equivalence Relation for state* |
Cstate_ptr_hash | Hash Function for state* |
Cstate_ptr_less_than | Strict Weak Ordering for state* |
Cstate_shared_ptr_equal | An Equivalence Relation for shared_state (shared_ptr<const state*>) |
Cstate_shared_ptr_hash | Hash Function for shared_state (shared_ptr<const state*>) |
Cstate_shared_ptr_less_than | Strict Weak Ordering for shared_state (shared_ptr<const state*>) |
►Cstate_ta_explicit | |
Ctransition | Explicit transitions |
Cstate_ta_product | A state for spot::ta_product |
Cstate_unicity_table | Render state pointers unique via a hash table |
Cstopwatch | A simple stopwatch |
Cta | A Testing Automaton |
Cta_check | Check whether the language of a product (spot::ta_product) between a Kripke structure and a TA is empty. It works also for the product using Generalized TA (GTA and SGTA) |
Cta_explicit | |
Cta_explicit_succ_iterator | Successor iterators used by spot::ta_explicit |
Cta_product | A lazy product between a Testing automaton and a Kripke structure. (States are computed on the fly.) |
Cta_reachable_iterator | Iterate over all reachable states of a spot::ta |
Cta_reachable_iterator_breadth_first | An implementation of spot::ta_reachable_iterator that browses states breadth first |
Cta_reachable_iterator_depth_first | An implementation of spot::ta_reachable_iterator that browses states depth first |
Cta_statistics | |
Cta_succ_iterator | Iterate over the successors of a state |
Cta_succ_iterator_product | Iterate over the successors of a product computed on the fly |
Cta_succ_iterator_product_by_changeset | |
Ctaa_succ_iterator | |
►Ctaa_tgba | A self-loop Transition-based Alternating Automaton (TAA) which is seen as a TGBA (abstract class, see below) |
Ctransition | Explicit transitions |
Ctaa_tgba_formula | |
Ctaa_tgba_labelled | |
Ctaa_tgba_string | |
Ctemporary_file | Temporary file name |
Ctgta | A Transition-based Generalized Testing Automaton (TGTA) |
Ctgta_explicit | |
Ctgta_product | A lazy product. (States are computed on the fly.) |
Ctgta_succ_iterator_product | Iterate over the successors of a product computed on the fly |
Ctime_info | A structure to record elapsed time in clock ticks |
Ctimer | |
Ctimer_map | A map of timer, where each timer has a name |
Ctl_simplifier | Rewrite or simplify f in various ways |
Ctl_simplifier_options | |
Ctranslator | Translate an LTL formula into an optimized spot::tgba |
Ctrival | A class implementing Kleene's three-valued logic |
Ctwa | A Transition-based ω-Automaton |
Ctwa_graph | Graph-based representation of a TωA |
Ctwa_graph_edge_data | Data attached to edges of a twa_graph |
Ctwa_graph_state | Graph-based representation of a TωA |
Ctwa_graph_succ_iterator | Iterator used by the on-the-fly interface of twa_graph |
Ctwa_product | A lazy product. (States are computed on the fly.) |
Ctwa_product_init | A lazy product with different initial states |
Ctwa_reachable_iterator | Iterate over all reachable states of a spot::tgba |
Ctwa_reachable_iterator_breadth_first | An implementation of spot::twa_reachable_iterator that browses states breadth first |
►Ctwa_reachable_iterator_depth_first | Iterate over all states of an automaton using a DFS |
Cstack_item | |
Ctwa_reachable_iterator_depth_first_stack | Iterate over all states of an automaton using a DFS |
►Ctwa_run | An accepted run, for a twa |
Cstep | |
Ctwa_statistics | |
Ctwa_sub_statistics | |
Ctwa_succ_iterator | Iterate over the successors of a state |
Ctwa_word | An infinite word stored as a lasso |
Cunabbreviator | Clone and rewrite a formula to remove specified operators logical operators |
Cunsigned_statistics | |
►Nstd | |
Chash< spot::acc_cond::mark_t > | |
Chash< spot::formula > | |
►Ntlyy | |
►Cparser | A Bison parser |
Cbasic_symbol | |
Cby_type | Type access provider for token (enum) based symbols |
Csemantic_type | Symbol semantic values |
Csyntax_error | Syntax errors thrown from user actions |
Ctoken | Tokens |
Cslice | Present a slice of the top of a stack |
Cstack | |
Cminmax_t | |