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

lbtt 1.1.0 supports TGBAs, use that and remove old workarounds.

Browse source 
* src/tgbaalgos/lbtt.cc (state_acc_pair, state_acc_pair_equal,
state_acc_pair_hash, acp_seen_map, todo_set, seen_map, fill_todo
lbtt_reachable): Remove.
(nonacceptant_lbtt_bfs): Rename as ...
(lbtt_bfs): ... this, and adjust to output acceptance conditions
on transitions.
(nonacceptant_lbtt_reachable): Rename as ...
(lbtt_reachable): ... this.
* src/tgbaalgos/lbtt.hh (nonacceptant_lbtt_reachable): Delete.
* src/tgbatest/ltl2tgba.cc: Suppress option "-T".
This commit is contained in:
Alexandre Duret-Lutz 2004-07-08 16:42:00 +00:00
parent 59df610023
commit 3b85646638
4 changed files with 32 additions and 239 deletions
Download patch file Download diff file Expand all files Collapse all files

15
src/tgbatest/ltl2tgba.cc
View file

@ -91,22 +91,20 @@ syntax(char* prog)
<< " -R1 use direct simulation to reduce the automata "
<< "(use -L for more reduction)"
<< std::endl
<< " -R2 use delayed simulation to reduce the automata, incorrect"
<< " -R2 use delayed simulation to reduce the automata "
<< "(use -L for more reduction)"
<< std::endl
<< " -R3 use SCC to reduce the automata"
<< std::endl
<< " -Rd to display simulation relation"
<< " -Rd display the simulation relation"
<< std::endl
<< " -RD to display parity game (dot format)"
<< " -RD display the parity game (dot format)"
<< std::endl
<< " -s convert to explicit automata, and number states "
<< "in DFS order" << std::endl
<< " -S convert to explicit automata, and number states "
<< "in BFS order" << std::endl
<< " -t display reachable states in LBTT's format" << std::endl
<< " -T display reachable states in LBTT's format w/o "
<< "acceptance conditions" << std::endl
<< " -v display the BDD variables used by the automaton"
<< std::endl
<< " -x try to produce a more deterministic automata "
@ -296,10 +294,6 @@ main(int argc, char** argv)
{
output = 6;
}
else if (!strcmp(argv[formula_index], "-T"))
{
output = 7;
}
else if (!strcmp(argv[formula_index], "-v"))
{
output = 5;
@ -488,9 +482,6 @@ main(int argc, char** argv)
case 6:
spot::lbtt_reachable(std::cout, a);
break;
case 7:
spot::nonacceptant_lbtt_reachable(std::cout, a);
break;
case 8:
spot::never_claim_reachable(std::cout, degeneralized, f);
break;