alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

* src/tgbatest/ltl2tgba.cc (syntax): Keep options sorted.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2004-05-24 17:47:00 +00:00
parent 9d375915f7
commit 57f6fcc40c
2 changed files with 9 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

2
ChangeLog
View file

@ -1,5 +1,7 @@
2004-05-24 Alexandre Duret-Lutz <adl@src.lip6.fr> 2004-05-24 Alexandre Duret-Lutz <adl@src.lip6.fr>
* src/tgbatest/ltl2tgba.cc (syntax): Keep options sorted.
* src/sanity/Makefile.am (EXTRA_DIST): Distribute 80columns.test * src/sanity/Makefile.am (EXTRA_DIST): Distribute 80columns.test
and style.test. and style.test.

18
src/tgbatest/ltl2tgba.cc
View file

@ -77,6 +77,12 @@ syntax(char* prog)
<< " -p branching postponement (implies -f)" << std::endl << " -p branching postponement (implies -f)" << std::endl
<< " -r display the relation BDD, not the reachability graph" << " -r display the relation BDD, not the reachability graph"
<< std::endl << std::endl
<< " -r1 reduce formula using basic rewriting" << std::endl
<< " -r2 reduce formula using class of eventuality and "
<< "and universality" << std::endl
<< " -r3 reduce formula using implication between "
<< "sub-formulae" << std::endl
<< " -r4 reduce formula using all rules" << std::endl
<< " -R same as -r, but as a set" << std::endl << " -R same as -r, but as a set" << std::endl
<< " -s convert to explicit automata, and number states " << " -s convert to explicit automata, and number states "
<< "in DFS order" << std::endl << "in DFS order" << std::endl
@ -92,17 +98,7 @@ syntax(char* prog)
<< " -X do not compute an automaton, read it from a file" << " -X do not compute an automaton, read it from a file"
<< std::endl << std::endl
<< " -y do not merge states with same symbolic representation " << " -y do not merge states with same symbolic representation "
<< "(implies -f)" << std::endl << "(implies -f)" << std::endl;
<< " -r1 to reduce formula using basic rewriting"
<< std::endl
<< " -r2 to reduce formula using class of eventuality and "
<< "and universality"
<< std::endl
<< " -r3 to reduce formula using implication between "
<< "two formula"
<< std::endl
<< " -r4 to reduce formula using all rules"
<< std::endl;
exit(2); exit(2);
} }