Classes | |
class | spot::bfs_steps |
Make a BFS in a spot::tgba to compute a tgba_run::steps. More... | |
struct | spot::tgba_statistics |
Functions | |
tgba_explicit * | spot::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 * | spot::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. | |
tgba_explicit * | spot::tgba_powerset (const tgba *aut) |
Build a deterministic automaton, ignoring acceptance conditions. | |
tgba * | spot::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_statistics | spot::stats_reachable (const tgba *g) |
Compute statistics for an automaton. |
|
Construct a tgba randomly.
@TechReport{ tauriainen.00.a66, author = {Heikki Tauriainen}, title = {Automated Testing of {B\"u}chi Automata Translators for {L}inear {T}emporal {L}ogic}, address = {Espoo, Finland}, institution = {Helsinki University of Technology, Laboratory for Theoretical Computer Science}, number = {A66}, year = {2000}, url = {http://citeseer.nj.nec.com/tauriainen00automated.html}, type = {Research Report}, note = {Reprint of Master's thesis} }
Although the intent is similar, there are some differences with between the above published algorithm and this implementation . First labels are on transitions, and acceptance conditions are generated too. Second, the number of successors of a node is chosen in |
|
Compute statistics for an automaton.
|
|
Build an explicit automata from all states of aut, numbering states in bread first order as they are processed.
|
|
Build an explicit automata from all states of aut, numbering states in depth first order as they are processed.
|
|
Build a deterministic automaton, ignoring acceptance conditions. This create a deterministic automaton that recognize the same language as aut would if its acceptance conditions were ignored. This is the classical powerset algorithm. |