Classes | |
| class | evtgba |
| class | evtgba_iterator |
| class | evtgba_explicit |
| class | state_evtgba_explicit |
| States used by spot::tgba_evtgba_explicit. More... | |
| class | evtgba_product |
| class | symbol |
| class | rsymbol |
| class | evtgba_reachable_iterator |
| Iterate over all reachable states of a spot::evtgba. More... | |
| class | evtgba_reachable_iterator_depth_first |
| An implementation of spot::evtgba_reachable_iterator that browses states depth first. More... | |
| class | evtgba_reachable_iterator_breadth_first |
| An implementation of spot::evtgba_reachable_iterator that browses states breadth first. More... | |
| class | bdd_allocator |
| Manage ranges of variables. More... | |
| struct | bdd_less_than |
| Comparison functor for BDDs. More... | |
| class | free_list |
| Manage list of free integers. More... | |
| struct | ptr_hash |
| A hash function for pointers. More... | |
| struct | string_hash |
| A hash function for strings. More... | |
| struct | char_ptr_less_than |
Strict Weak Ordering for char*. More... | |
| class | minato_isop |
| Generate an irredundant sum-of-products (ISOP) form of a BDD function. More... | |
| class | loopless_modular_mixed_radix_gray_code |
| Loopless modular mixed radix Gray code iteration. More... | |
| class | option_map |
| Manage a map of options. More... | |
| class | barand |
| Compute pseudo-random integer value between 0 and n included, following a binomial distribution for probability p. More... | |
| struct | time_info |
| A structure to record elapsed time in clock ticks. More... | |
| class | timer |
| A timekeeper that accumulate interval of time. More... | |
| class | timer_map |
| A map of timer, where each timer has a name. More... | |
| class | bdd_dict |
| class | state |
| Abstract class for states. More... | |
| struct | state_ptr_less_than |
Strict Weak Ordering for state*. More... | |
| struct | state_ptr_equal |
An Equivalence Relation for state*. More... | |
| struct | state_ptr_hash |
Hash Function for state*. More... | |
| class | state_bdd |
| class | tgba_succ_iterator |
| Iterate over the successors of a state. More... | |
| class | tgba_succ_iterator_concrete |
| class | tgba |
| A Transition-based Generalized Büchi Automaton. More... | |
| class | tgba_bdd_concrete |
| A concrete spot::tgba implemented using BDDs. More... | |
| class | tgba_bdd_concrete_factory |
| Helper class to build a spot::tgba_bdd_concrete object. More... | |
| struct | tgba_bdd_core_data |
| Core data for a TGBA encoded using BDDs. More... | |
| class | tgba_bdd_factory |
| Abstract class for spot::tgba_bdd_concrete factories. More... | |
| class | tgba_explicit |
| class | state_explicit |
| class | tgba_explicit_succ_iterator |
| class | state_product |
| A state for spot::tgba_product. More... | |
| class | tgba_succ_iterator_product |
| Iterate over the successors of a product computed on the fly. More... | |
| class | tgba_product |
| A lazy product. (States are computed on the fly.). More... | |
| class | direct_simulation_relation |
| class | delayed_simulation_relation |
| class | tgba_reduc |
| class | tgba_tba_proxy |
| Degeneralize a spot::tgba on the fly, producing a TBA. More... | |
| class | tgba_sba_proxy |
| Degeneralize a spot::tgba on the fly, producing an SBA. More... | |
| class | bfs_steps |
| Make a BFS in a spot::tgba to compute a tgba_run::steps. More... | |
| class | dotty_decorator |
| Choose state and link styles for spot::dotty_reachable. More... | |
| class | emptiness_check_result |
| The result of an emptiness check. More... | |
| class | emptiness_check |
| Common interface to emptiness check algorithms. More... | |
| class | emptiness_check_instantiator |
| struct | tgba_run |
| An accepted run, for a tgba. More... | |
| struct | unsigned_statistics |
| class | unsigned_statistics_copy |
| comparable statistics More... | |
| class | ec_statistics |
| Emptiness-check statistics. More... | |
| class | ars_statistics |
| Accepting Run Search statistics. More... | |
| class | acss_statistics |
| Accepting Cycle Search Space statistics. More... | |
| class | couvreur99_check_result |
| Compute a counter example from a spot::couvreur99_check_status. More... | |
| class | explicit_connected_component |
| An SCC storing all its states explicitly. More... | |
| class | connected_component_hash_set |
| class | explicit_connected_component_factory |
| Abstract factory for explicit_connected_component. More... | |
| class | connected_component_hash_set_factory |
| Factory for connected_component_hash_set. More... | |
| class | couvreur99_check |
| An implementation of the Couvreur99 emptiness-check algorithm. More... | |
| class | couvreur99_check_shy |
| A version of spot::couvreur99_check that tries to visit known states first. More... | |
| class | numbered_state_heap_const_iterator |
| Iterator on numbered_state_heap objects. More... | |
| class | numbered_state_heap |
| Keep track of a large quantity of indexed states. More... | |
| class | numbered_state_heap_factory |
| Abstract factory for numbered_state_heap. More... | |
| class | numbered_state_heap_hash_map |
| A straightforward implementation of numbered_state_heap with a hash map. More... | |
| class | numbered_state_heap_hash_map_factory |
| Factory for numbered_state_heap_hash_map. More... | |
| class | scc_stack |
| class | couvreur99_check_status |
| The status of the emptiness-check on success. More... | |
| class | tgba_reachable_iterator |
| Iterate over all reachable states of a spot::tgba. More... | |
| class | tgba_reachable_iterator_depth_first |
| An implementation of spot::tgba_reachable_iterator that browses states depth first. More... | |
| class | tgba_reachable_iterator_breadth_first |
| An implementation of spot::tgba_reachable_iterator that browses states breadth first. More... | |
| class | parity_game_graph |
| Parity game graph which compute a simulation relation. More... | |
| class | spoiler_node |
| Spoiler node of parity game graph. More... | |
| class | duplicator_node |
| Duplicator node of parity game graph. More... | |
| class | parity_game_graph_direct |
| Parity game graph which compute the direct simulation relation. More... | |
| class | spoiler_node_delayed |
| Spoiler node of parity game graph for delayed simulation. More... | |
| class | duplicator_node_delayed |
| Duplicator node of parity game graph for delayed simulation. More... | |
| class | parity_game_graph_delayed |
| class | tgba_run_dotty_decorator |
| Highlight a spot::tgba_run on a spot::tgba. More... | |
| struct | tgba_statistics |
| class | weight |
| Manage for a given automaton a vector of counter indexed by its acceptance condition. More... | |
| class | gspn_exception |
| An exception used to forward GSPN errors. More... | |
| class | gspn_interface |
| class | gspn_ssp_interface |
Namespaces | |
| namespace | ltl |
Typedefs | |
| typedef std::set< const symbol * > | symbol_set |
| typedef std::set< rsymbol > | rsymbol_set |
| typedef std::pair< evtgbayy::location, std::string > | evtgba_parse_error |
| A parse diagnostic with its location. | |
| typedef std::list< evtgba_parse_error > | evtgba_parse_error_list |
| A list of parser diagnostics, as filled by parse. | |
| typedef std::pair< const spot::state *, const spot::state * > | state_couple |
| typedef std::vector< state_couple * > | simulation_relation |
| typedef std::vector< spoiler_node * > | sn_v |
| typedef std::vector< duplicator_node * > | dn_v |
| typedef std::vector< const state * > | s_v |
| typedef std::pair< tgbayy::location, std::string > | tgba_parse_error |
| A parse diagnostic with its location. | |
| typedef std::list< tgba_parse_error > | tgba_parse_error_list |
| A list of parser diagnostics, as filled by parse. | |
Enumerations | |
| enum | reduce_tgba_options { Reduce_None = 0, Reduce_quotient_Dir_Sim = 1, Reduce_transition_Dir_Sim = 2, Reduce_quotient_Del_Sim = 4, Reduce_transition_Del_Sim = 8, Reduce_Scc = 16, Reduce_All = -1U } |
| Options for reduce. More... | |
Functions | |
| std::ostream & | dotty_reachable (std::ostream &os, const evtgba *g) |
| Print reachable states in dot format. | |
| std::ostream & | evtgba_save_reachable (std::ostream &os, const evtgba *g) |
| Save reachable states in text format. | |
| evtgba_explicit * | tgba_to_evtgba (const tgba *a) |
| Convert a tgba into an evtgba. | |
| evtgba_explicit * | evtgba_parse (const std::string &filename, evtgba_parse_error_list &error_list, bool debug=false) |
| Build a spot::evtgba_explicit from a text file. | |
| bool | format_evtgba_parse_errors (std::ostream &os, const std::string &filename, evtgba_parse_error_list &error_list) |
| Format diagnostics produced by spot::evtgba_parse. | |
| bool | is_bare_word (const char *str) |
| std::string | quote_unless_bare_word (const std::string &str) |
| Double-quote words that are not bare. | |
| std::ostream & | escape_str (std::ostream &os, const std::string &str) |
| Escape " and \ characters in str. | |
| std::string | escape_str (const std::string &str) |
| Escape " and \ characters in str. | |
| size_t | wang32_hash (size_t key) |
| Thomas Wang's 32 bit hash function. | |
| size_t | knuth32_hash (size_t key) |
| Knuth's Multiplicative hash function. | |
| int | memusage () |
| Total number of pages in use by the program. | |
| void | srand (unsigned int seed) |
| Reset the seed of the pseudo-random number generator. | |
| int | rrand (int min, int max) |
| Compute a pseudo-random integer value between min and max included. | |
| int | mrand (int max) |
| Compute a pseudo-random integer value between 0 and max-1 included. | |
| double | drand () |
| Compute a pseudo-random double value between 0.0 and 1.0 (1.0 excluded). | |
| double | nrand () |
| Compute a pseudo-random double value following a standard normal distribution. (Odeh & Evans). | |
| double | bmrand () |
| Compute a pseudo-random double value following a standard normal distribution. (Box-Muller). | |
| int | prand (double p) |
| Return a pseudo-random positive integer value following a Poisson distribution with parameter p. | |
| const char * | version () |
| Return Spot's version. | |
| std::ostream & | bdd_print_sat (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a list of literals. | |
| std::string | bdd_format_sat (const bdd_dict *dict, bdd b) |
| Format a BDD as a list of literals. | |
| std::ostream & | bdd_print_acc (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a list of acceptance conditions. | |
| std::ostream & | bdd_print_accset (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a set of acceptance conditions. | |
| std::string | bdd_format_accset (const bdd_dict *dict, bdd b) |
| Format a BDD as a set of acceptance conditions. | |
| std::ostream & | bdd_print_set (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a set. | |
| std::string | bdd_format_set (const bdd_dict *dict, bdd b) |
| Format a BDD as a set. | |
| std::ostream & | bdd_print_formula (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a formula. | |
| std::string | bdd_format_formula (const bdd_dict *dict, bdd b) |
| Format a BDD as a formula. | |
| std::ostream & | bdd_print_dot (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a diagram in dotty format. | |
| std::ostream & | bdd_print_table (std::ostream &os, const bdd_dict *dict, bdd b) |
| Print a BDD as a table. | |
| bdd | formula_to_bdd (const ltl::formula *f, bdd_dict *d, void *for_me) |
| const ltl::formula * | bdd_to_formula (bdd f, const bdd_dict *d) |
| tgba_bdd_concrete * | product (const tgba_bdd_concrete *left, const tgba_bdd_concrete *right) |
| Multiplies two spot::tgba_bdd_concrete automata. | |
| std::ostream & | dotty_reachable (std::ostream &os, const tgba *g, dotty_decorator *dd=dotty_decorator::instance()) |
| Print reachable states in dot format. | |
| tgba_explicit * | tgba_dupexp_bfs (const tgba *aut) |
| Build an explicit automata from all states of aut, numbering states in bread first order as they are processed. | |
| tgba_explicit * | tgba_dupexp_dfs (const tgba *aut) |
| Build an explicit automata from all states of aut, numbering states in depth first order as they are processed. | |
| std::ostream & | print_tgba_run (std::ostream &os, const tgba *a, const tgba_run *run) |
| Display a tgba_run. | |
| tgba * | tgba_run_to_tgba (const tgba *a, const tgba_run *run) |
| Return an explicit_tgba corresponding to run (i.e. comparable states are merged). | |
| emptiness_check * | couvreur99 (const tgba *a, option_map options=option_map(), const numbered_state_heap_factory *nshf=numbered_state_heap_hash_map_factory::instance()) |
| Check whether the language of an automate is empty. | |
| emptiness_check * | explicit_gv04_check (const tgba *a, option_map o=option_map()) |
| Emptiness check based on Geldenhuys and Valmari's TACAS'04 paper. | |
| std::ostream & | lbtt_reachable (std::ostream &os, const tgba *g) |
| Print reachable states in LBTT format. | |
| tgba_explicit * | ltl_to_tgba_fm (const ltl::formula *f, bdd_dict *dict, bool exprop=false, bool symb_merge=true, bool branching_postponement=false, bool fair_loop_approx=false, const ltl::atomic_prop_set *unobs=0, int reduce_ltl=ltl::Reduce_None, bool containment_checks=false) |
| Build a spot::tgba_explicit* from an LTL formula. | |
| tgba_bdd_concrete * | ltl_to_tgba_lacim (const ltl::formula *f, bdd_dict *dict) |
| Build a spot::tgba_bdd_concrete from an LTL formula. | |
| emptiness_check * | explicit_magic_search (const tgba *a, option_map o=option_map()) |
| Returns an emptiness checker on the spot::tgba automaton a. | |
| emptiness_check * | bit_state_hashing_magic_search (const tgba *a, size_t size, option_map o=option_map()) |
| Returns an emptiness checker on the spot::tgba automaton a. | |
| emptiness_check * | magic_search (const tgba *a, option_map o=option_map()) |
| Wrapper for the two magic_search implementations. | |
| std::ostream & | never_claim_reachable (std::ostream &os, const tgba_sba_proxy *g, const ltl::formula *f=0) |
| Print reachable states in Spin never claim format. | |
| tgba_explicit * | tgba_powerset (const tgba *aut) |
| Build a deterministic automaton, ignoring acceptance conditions. | |
| tgba_run * | project_tgba_run (const tgba *a_run, const tgba *a_proj, const tgba_run *run) |
| Project a tgba_run on a tgba. | |
| tgba * | random_graph (int n, float d, const ltl::atomic_prop_set *ap, bdd_dict *dict, int n_acc=0, float a=0.1, float t=0.5, ltl::environment *env=<l::default_environment::instance()) |
| Construct a tgba randomly. | |
| tgba_run * | reduce_run (const tgba *a, const tgba_run *org) |
| Reduce an accepting run. | |
| tgba * | reduc_tgba_sim (const tgba *a, int opt=Reduce_All) |
| Remove some node of the automata using a simulation relation. | |
| direct_simulation_relation * | get_direct_relation_simulation (const tgba *a, std::ostream &os, int opt=-1) |
| Compute a direct simulation relation on state of tgba f. | |
| delayed_simulation_relation * | get_delayed_relation_simulation (const tgba *a, std::ostream &os, int opt=-1) |
| void | free_relation_simulation (direct_simulation_relation *rel) |
| To free a simulation relation. | |
| void | free_relation_simulation (delayed_simulation_relation *rel) |
| To free a simulation relation. | |
| bool | replay_tgba_run (std::ostream &os, const tgba *a, const tgba_run *run, bool debug=false) |
| Replay a tgba_run on a tgba. | |
| std::ostream & | tgba_save_reachable (std::ostream &os, const tgba *g) |
| Save reachable states in text format. | |
| emptiness_check * | explicit_se05_search (const tgba *a, option_map o=option_map()) |
| Returns an emptiness check on the spot::tgba automaton a. | |
| emptiness_check * | bit_state_hashing_se05_search (const tgba *a, size_t size, option_map o=option_map()) |
| Returns an emptiness checker on the spot::tgba automaton a. | |
| emptiness_check * | se05 (const tgba *a, option_map o) |
| Wrapper for the two se05 implementations. | |
| tgba_statistics | stats_reachable (const tgba *g) |
| Compute statistics for an automaton. | |
| emptiness_check * | explicit_tau03_search (const tgba *a, option_map o=option_map()) |
| Returns an emptiness checker on the spot::tgba automaton a. | |
| emptiness_check * | explicit_tau03_opt_search (const tgba *a, option_map o=option_map()) |
| Returns an emptiness checker on the spot::tgba automaton a. | |
| tgba_explicit * | tgba_parse (const std::string &filename, tgba_parse_error_list &error_list, bdd_dict *dict, ltl::environment &env=ltl::default_environment::instance(), ltl::environment &envacc=ltl::default_environment::instance(), bool debug=false) |
| Build a spot::tgba_explicit from a text file. | |
| bool | format_tgba_parse_errors (std::ostream &os, const std::string &filename, tgba_parse_error_list &error_list) |
| Format diagnostics produced by spot::tgba_parse. | |
| std::ostream & | operator<< (std::ostream &os, const gspn_exception &e) |
| couvreur99_check * | couvreur99_check_ssp_semi (const tgba *ssp_automata) |
| couvreur99_check * | couvreur99_check_ssp_shy_semi (const tgba *ssp_automata) |
| couvreur99_check * | couvreur99_check_ssp_shy (const tgba *ssp_automata, bool stack_inclusion=true) |
| typedef std::pair<evtgbayy::location, std::string> spot::evtgba_parse_error |
A parse diagnostic with its location.
| typedef std::list<evtgba_parse_error> spot::evtgba_parse_error_list |
A list of parser diagnostics, as filled by parse.
| typedef std::set<rsymbol> spot::rsymbol_set |
| typedef std::vector<state_couple*> spot::simulation_relation |
| typedef std::pair<const spot::state*, const spot::state*> spot::state_couple |
| typedef std::set<const symbol*> spot::symbol_set |
| std::string spot::bdd_format_accset | ( | const bdd_dict * | dict, | |
| bdd | b | |||
| ) |
Format a BDD as a set of acceptance conditions.
This is used when saving a TGBA.
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::string spot::bdd_format_formula | ( | const bdd_dict * | dict, | |
| bdd | b | |||
| ) |
Format a BDD as a formula.
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::string spot::bdd_format_sat | ( | const bdd_dict * | dict, | |
| bdd | b | |||
| ) |
Format a BDD as a list of literals.
This assumes that b is a conjunction of literals.
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::string spot::bdd_format_set | ( | const bdd_dict * | dict, | |
| bdd | b | |||
| ) |
Format a BDD as a set.
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_acc | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a list of acceptance conditions.
This is used when saving a TGBA.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_accset | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a set of acceptance conditions.
This is used when saving a TGBA.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_dot | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a diagram in dotty format.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_formula | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a formula.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_sat | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a list of literals.
This assumes that b is a conjunction of literals.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_set | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a set.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| std::ostream& spot::bdd_print_table | ( | std::ostream & | os, | |
| const bdd_dict * | dict, | |||
| bdd | b | |||
| ) |
Print a BDD as a table.
| os | The output stream. | |
| dict | The dictionary to use, to lookup variables. | |
| b | The BDD to print. |
| const ltl::formula* spot::bdd_to_formula | ( | bdd | f, | |
| const bdd_dict * | d | |||
| ) |
| std::ostream& spot::dotty_reachable | ( | std::ostream & | os, | |
| const evtgba * | g | |||
| ) |
Print reachable states in dot format.
| evtgba_explicit* spot::evtgba_parse | ( | const std::string & | filename, | |
| evtgba_parse_error_list & | error_list, | |||
| bool | debug = false | |||
| ) |
Build a spot::evtgba_explicit from a text file.
| filename | The name of the file to parse. | |
| error_list | A list that will be filled with parse errors that occured during parsing. | |
| debug | When true, causes the parser to trace its execution. |
| std::ostream& spot::evtgba_save_reachable | ( | std::ostream & | os, | |
| const evtgba * | g | |||
| ) |
Save reachable states in text format.
| bool spot::format_evtgba_parse_errors | ( | std::ostream & | os, | |
| const std::string & | filename, | |||
| evtgba_parse_error_list & | error_list | |||
| ) |
Format diagnostics produced by spot::evtgba_parse.
| os | Where diagnostics should be output. | |
| filename | The filename that should appear in the diagnostics. | |
| error_list | The error list filled by spot::ltl::parse while parsing ltl_string. |
true iff any diagnostic was output. | bdd spot::formula_to_bdd | ( | const ltl::formula * | f, | |
| bdd_dict * | d, | |||
| void * | for_me | |||
| ) |
| int spot::memusage | ( | ) |
Total number of pages in use by the program.
| std::ostream& spot::operator<< | ( | std::ostream & | os, | |
| const gspn_exception & | e | |||
| ) |
| evtgba_explicit* spot::tgba_to_evtgba | ( | const tgba * | a | ) |
1.5.2