usage
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
| usage [2018/11/14 16:09] – [Learning Algorithms for Büchi automata] liyong | usage [2018/11/14 16:09] – [Lazy Equivalence Check] liyong | ||
|---|---|---|---|
| Line 90: | Line 90: | ||
| - | * -under. This method under-approximates the ultimately periodic words accepted by the conjectured FDFA. | + | |
| - | * -over. It over-approximates the ultimately periodic words accepted by the conjectured FDFA. | + | |
| === Limit Deterministic Büchi Automata === | === Limit Deterministic Büchi Automata === | ||
| - | You can also get a limit deterministic Büchi automaton as the final output automaton by giving the option -ldba when using the L< | + | You can also get a limit deterministic Büchi automaton as the final output automaton by giving the option |
| An example is given below. | An example is given below. | ||
| < | < | ||
| Line 106: | Line 106: | ||
| If you want to reuse the counterexample returned by the teacher as much as possible, you can use the | If you want to reuse the counterexample returned by the teacher as much as possible, you can use the | ||
| lazy equivalence check optimization as follows (NOT TESTED). | lazy equivalence check optimization as follows (NOT TESTED). | ||
| - | This option is not encouraged since it may result in larger output automaton. | + | This option is **not encouraged** since it may result in larger output automaton. |
| < | < | ||
| java -jar ROLL.jar learn aut.ba -table -periodic -lazyeq | java -jar ROLL.jar learn aut.ba -table -periodic -lazyeq | ||
usage.txt · Last modified: 2018/11/15 20:21 by liyong