| ►Nspot | |
| ►Cacc_cond | An acceptance condition |
| Cacc_code | An acceptance formula |
| Cacc_word | A "node" in an acceptance formulas |
| Cmark_t | An acceptance mark |
| Crs_pair | Rabin/streett pairs used by is_rabin_like and is_streett_like |
| Cacd | Alternating Cycle Decomposition implementation |
| Cacss_statistics | Accepting Cycle Search Space statistics |
| ►Cadjlist | A compact adjacency list representation for directed graphs |
| Csuccessor_iterator | Iterator for traversing successors of a state |
| Csuccessor_range | Range wrapper for successor iteration |
| Caig | A class representing AIG circuits |
| Cars_statistics | Accepting Run Search statistics |
| Cautomaton_parser_options | Options controlling the behavior of the automaton stream parser |
| Cautomaton_stream_parser | Parse a stream of automata |
| Cbackprop_graph | Graph used for backward propagation of winning conditions in parity games |
| Cbarand | Compute pseudo-random integer value between 0 and n included, following a binomial distribution with probability p |
| ►Cbdd_dict | Map BDD variables to formulas |
| Cbdd_info | Information stored for one BDD variable |
| Cbdd_dict_preorder | A BDD dictionary wrapper that pre-registers atomic propositions before use |
| 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 |
| Cbitset | A fixed-size bitset backed by N unsigned words |
| Cbitvect | A bit vector |
| Cbitvect_array | An array of fixed-size bit vectors allocated contiguously |
| Cchar_ptr_less_than | Strict Weak Ordering for char* |
| Ccouvreur99_check | An implementation of the Couvreur99 emptiness-check algorithm |
| Ccouvreur99_check_result | |
| ►Ccouvreur99_check_shy | A version of spot::couvreur99_check that tries to visit known states first |
| Csuccessor | A successor state with its associated acceptance marks, used in the shy Couvreur check |
| Ctodo_item | DFS stack item holding a state and its queue of unprocessed successors |
| Ccouvreur99_check_status | The status of the emptiness-check on success |
| ►Ccspins_iterator | This class provides an iterator over the successors of a state. All successors are computed once when an iterator is recycled or created |
| Ccspins_iterator_param | Arguments bundle passed to construct or recycle a cspins_iterator |
| Ccspins_state_equal | This class provides the ability to compare two states |
| Ccspins_state_hash | This class provides the ability to hash a state |
| Ccspins_state_manager | The management of states (i.e. allocation/deallocation) can be painless since every time we have to consider whether the state will be compressed or not. This class aims to simplify this management |
| Ccstate | Class for thread-safe states |
| Ccubeset | Manager for allocating and manipulating cubes (bit-encoded partial assignments over APs) |
| Cdeclarative_environment | A declarative environment |
| Cdefault_environment | A laxist environment |
| Cdigraph | A directed graph |
| Cec_statistics | Emptiness-check statistics |
| Cec_stats | This structure contains, for each thread, the collected information during the traversal |
| Cedge_separator | Separate edges so that their labels are disjoint |
| ►Cedge_separator_filter | A filter for iterating over edge labels compatible with a given BDD condition |
| Citerator | Iterator over edge labels compatible with the filter's BDD condition |
| 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 | DFS stack entry for the cycle enumeration algorithm |
| Cstate_info | Per-state information maintained by the cycle enumeration algorithm |
| Cenvironment | An environment that describes atomic propositions |
| Cexclusive_ap | A set of atomic proposition groups that are mutually exclusive within each group |
| 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 |
| Cfm_edge | A single successor edge from a formula-state |
| Cfm_simple_edge | A simplified successor edge without condition |
| Cfnode | Actual storage for formula nodes |
| Cfnv | Struct for Fowler-Noll-Vo parameters |
| Cfnv< T, typename std::enable_if< sizeof(T)==4 >::type > | Fowler-Noll-Vo hash parameters for 32 bits |
| Cfnv< T, typename std::enable_if< sizeof(T)==8 >::type > | Fowler-Noll-Vo hash parameters for 64 bits |
| Cformater | A string formatter that dispatches %-escape sequences to printable objects |
| ►Cformula | Main class for temporal logic formula |
| Cformula_child_iterator | Allow iterating over children |
| Cformula_ptr_less_than_bool_first | Comparator for formula pointers that orders Boolean formulas before others |
| Cgame_relabeling_map | Pair of relabeling maps for environment and player edges in a synthesis game |
| Choa_abort | Exception thrown by the HOA lexer upon reading an "--ABORT--" marker |
| Choa_alias_formater | Help printing BDDs as text, using aliases |
| Cidentity_hash | A hash function that returns identity |
| Cinner_callback_parameters | Parameters passed to callbacks when generating successor states from the shared library produced by LTSmin |
| Cint_unionfind | This Union-Find data structure is a particular union-find, dedicated for emptiness checks below, see ec.hh. The key of this union-find is int. Moreover, we suppose that only consecutive int are inserted. This union-find includes most of the classical optimizations (IPC, LR, PC, MS) |
| Cis_a_kripkecube_ptr | This class allows to ensure (at compile time) if a given parameter is of type kripkecube. It also checks if the iterator has the right interface |
| Cisomorphism_checker | Check if two automata are isomorphic |
| ►Citerable_uf | Iterable Union-Find for parallel reachability algorithms |
| Cuf_element | Represents a Union-Find element |
| Cuf_element_hasher | Hasher for union-find elements |
| ►Citerable_uf_ec | Iterable Union-Find for parallel emptiness-check algorithms |
| Cuf_element | Represents a Union-Find element |
| Cuf_element_hasher | Hasher for union-find elements |
| Ckripke | Interface for a Kripke structure |
| Ckripke_graph | Kripke Structure |
| Ckripke_graph_state | Concrete class for kripke_graph states |
| Ckripke_graph_succ_iterator | Successor iterator for a graph-based Kripke structure state |
| Ckripke_succ_iterator | Iterator code for Kripke structure |
| Ckripkecube | This class is a template representation of a Kripke structure. It is composed of two template parameters: State represents a state of the Kripke structure, SuccIterator is an iterator over the (possible) successors of a state |
| Ckripkecube< cspins_state, cspins_iterator > | Thread-safe specialization of kripkecube for SpinS states and iterators |
| ►Ckripkecube_to_twa | Convert a (cube) model into a twa. Note that this algorithm cannot be run in parallel but could |
| Ctodo__element | DFS stack element pairing a state its with successor iterator |
| Clanguage_containment_checker | |
| Classo_enumerator | Lazily enumerate lasso-shaped accepted runs/words of bounded size |
| Clpar13 | This class implements the sequential emptiness check as presented in "Three SCC-based Emptiness Checks for Generalized
Büchi Automata" (Renault et al, LPAR 2013). Among the three emptiness checks that have been proposed, we opted to implement yGabow's one |
| ►Cltl_to_tgba_fm_otf | On-the-fly LTL→TGBA explorer |
| Coptions | Bundle the boolean options for translation |
| Cltlf_one_step_sat_rewrite_with_cache | Cached version of the one-step satisfiability rewriting for LTLf formulas |
| Cltlf_one_step_unsat_rewrite_with_cache | Cached version of the one-step unsatisfiability rewriting for LTLf formulas |
| Cltlf_simplifier | Cheap simplification rules for LTLf formulas |
| Cltlf_synthesis_options | Fine-tuning options for LTLf synthesis |
| Cltlf_translator | "Semi-internal" class used to implement ltlf_to_mtdfa() |
| Cltsmin_model | A loaded LTSmin model that can generate Kripke structures on-the-fly |
| Cmark_tools | Utilities for marking NegClosure and EConcat operators in temporal formulas |
| Cmealy_like | A struct that represents different types of mealy like objects |
| Cminato_isop | Generate an irredundant sum-of-products (ISOP) form of a BDD function |
| Cmtdfa | A DFA represented using shared multi-terminal BDDs |
| Cmtdfa_stats | Statistics about an mtdfa instance |
| Cmtdswa | MTBDD-based representation of a state-based ω-automaton |
| Cmtdtwa | A multi-terminal decision diagram representation of a TωA |
| Cmultiple_size_pool | A multiple-size memory pool implementation |
| Cnamed_graph | A graph wrapper associating named states to graph state indices |
| Cnca_st_info | |
| Copen_temporary_file | Open temporary file |
| Coption_map | Manage a map of options |
| Coutedge_combiner | Helper class to combine outgoing edges in alternating automata |
| Coutput_aborter | Helper object to specify when an algorithm should abort its construction |
| Cpair_hash | Hash functor for std::pair combining hashes of both elements |
| Cparallel_policy | This class is used to tell parallel algorithms what resources they may use |
| Cparse_error | Exception thrown when a parse error is encountered |
| 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 | Maps each powerset-construction state to the set of original states it represents |
| Cprintable | Abstract base class for objects that can be printed to a stream via a format string |
| Cprintable_acc_cond | A printable wrapper for an acceptance condition, for use in format strings |
| Cprintable_formula | A printable wrapper for a formula, for use in format strings |
| Cprintable_id | The default callback simply writes "%c" |
| Cprintable_long_size | A printable wrapper reporting reachable and total transition counts as long long |
| Cprintable_percent | Called by default for "%%" and "%\0" |
| Cprintable_scc_info | A printable wrapper for SCC information of an automaton, for use in format strings |
| Cprintable_size | A printable wrapper reporting reachable and total state/edge counts |
| Cprintable_value | A printable wrapper around a value of type T |
| Cprocess_timer | Struct used to start and stop both timer and stopwatch clocks |
| Cproduct_to_twa | Convert a (cube) product automaton into a twa Note that this algorithm cannot be run in parallel |
| Cptr_hash | A hash function for pointers |
| Crandltlgenerator | Generator of random LTL/PSL/SERE/Boolean formulas with configurable options |
| Crandom_boolean | Generate random Boolean formulas |
| ►Crandom_formula | Base class for random formula generators |
| Cop_proba | Entry describing one operator and its probability for random formula generation |
| Crandom_ltl | Generate random LTL formulas |
| Crandom_psl | Generate random PSL formulas |
| Crandom_sere | Generate random SERE |
| Crealizability_simplifier | Simplify a reactive specification, preserving realizability |
| Crealizability_simplifier_base | Simplify a reactive specification, preserving realizability |
| Creduce_parity_data | Internal data computed by the reduce_parity function |
| Cremove_ap | Helper for stripping or fixing atomic propositions in automata |
| Crs_pairs_view | A view over Rabin-Streett pairs restricted to a subset of acceptance marks |
| Csatsolver | Interface with a SAT solver |
| Csatsolver_command | Interface with a given sat solver |
| Cscc_and_mark_filter | Create a filter for SCC and marks |
| Cscc_info | Compute an SCC map and gather assorted information |
| Cscc_info_node | Storage for SCC related information |
| ►Cscc_stack | Stack of strongly connected components for the Tarjan-Couvreur emptiness-check algorithm |
| Cconnected_component | A strongly connected component with its index, accumulated acceptance marks, and remaining states |
| Cset_state | |
| Csimple_ltl_translator | "Semi-internal" for translating LTL using MTBDDs |
| Cspins_interface | Implementation of the PINS interface. This class is a wrapper that, given a file, will compile it w.r.t. the PINS interface. The class can then be manipulated transparently, regardless of the input format |
| Cstat_printer | Prints various statistics about a TGBA |
| Cstate | Abstract class for states |
| Cstate_product | A state for twa_product |
| Cstate_ptr_equal | An Equivalence Relation for state pointers |
| Cstate_ptr_hash | Hash Function for state pointers |
| Cstate_ptr_less_than | Strict Weak Ordering for state pointers |
| Cstate_shared_ptr_equal | An Equivalence Relation for shared_state |
| Cstate_shared_ptr_hash | Hash Function for shared_state |
| Cstate_shared_ptr_less_than | Strict Weak Ordering for shared_state |
| Cstate_unicity_table | Render state pointers unique via a hash table |
| Cstopwatch | A simple stopwatch |
| Cswarmed_bloemen | Bloemen parallel SCC decomposition algorithm for reachability |
| Cswarmed_bloemen_ec | Bloemen parallel SCC decomposition algorithm for emptiness check |
| Cswarmed_cndfs | Swarmed variant of the CNDFS parallel emptiness-check algorithm |
| Cswarmed_deadlock | This class aims to explore a model to detect whether it contains a deadlock. This deadlock detection performs a DFS traversal sharing information shared among multiple threads. If Deadlock equals std::true_type performs deadlock algorithm, otherwise perform a simple reachability |
| ►Csynthesis_info | Benchmarking data and options for synthesis |
| Cbench_var | Benchmarking variables tracking timing and counts for each step of synthesis |
| Ctaa_succ_iterator | Successor iterator for alternating automata with tree-and-automata (TAA) transitions |
| ►Ctaa_tgba | A self-loop Transition-based Alternating Automaton (TAA) which is seen as a TGBA (abstract class, see below) |
| Ctransition | An explicit TAA transition |
| Ctaa_tgba_formula | A TAA-TGBA automaton where states are labelled with formulas |
| Ctaa_tgba_labelled | |
| Ctaa_tgba_string | A TAA-TGBA automaton where states are labelled with strings |
| Ctemporary_file | Temporary file name |
| 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 | Options controlling which simplification passes the tl_simplifier applies |
| Cto_parity_data | Structure used by to_parity to store some information about the construction |
| Cto_parity_options | Options to control various optimizations of to_parity() |
| Ctrans_index | Class for iterators over transitions |
| Ctransition | Class for representing a transition |
| Ctransition_info | Transition information passed to callbacks during state-space exploration |
| Ctranslator | Translate an LTL formula into an optimized twa_graph |
| Ctrival | A class implementing Kleene's three-valued logic |
| ►Ctwa | A Transition-based ω-Automaton |
| Cprop_set | A structure for selecting a set of automaton properties to copy |
| 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 | DFS stack entry holding a state, its DFS number, and its active successor iterator |
| 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 | A single step in a TωA run, pairing a state with an edge label and acceptance marks |
| Ctwa_statistics | Basic statistics (states and edges counts) for a TωA |
| Ctwa_sub_statistics | Extended statistics including transition counts for a TωA |
| Ctwa_succ_iterator | Iterate over the successors of a state |
| Ctwa_univ_remover | On-the-fly TωA that removes universal edges from an alternating automaton |
| Ctwa_word | An infinite word stored as a lasso |
| Ctwacube | Class for representing a thread-safe twa |
| Cunabbreviator | Clone and rewrite a formula to remove specified operators logical operators |
| Cuniv_remover_state | State used during on-the-fly removal of universal edges from an alternating automaton |
| Cunsigned_statistics | Interface for retrieving unsigned integer statistics from an emptiness check |
| ►Czielonka_tree | Zielonka Tree implementation |
| Czielonka_node | A node in the Zielonka tree, storing parent, sibling, child links, level, and color set |
