This is something Soheib and I worked on back in July, but a
intricate memory corruption bug prevented me to check the patch in. It took me two days to realize why find_state() must do a double loop over the candidates to check for equality before checking for inclusion(s). * iface/gspn/ltlgspn.cc: New options, -e45 and -n. * iface/gspn/ssp.cc, iface/gspn/ssp.hh: Handle these. * src/tgbaalgos/gtec/gtec.cc (TRACE): Add some debugging traces. (couvreur99_check_shy::dump_queue): New function. * src/tgbaalgos/gtec/gtec.hh (couvreur99_check_shy::dump_queue): New function.
This commit is contained in:
parent
8d1b5e40b0
commit
cc0ca4ae54
6 changed files with 184 additions and 37 deletions
|
|
@ -56,7 +56,9 @@ namespace spot
|
|||
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);
|
||||
bool stack_inclusion = true,
|
||||
bool double_inclusion = false,
|
||||
bool no_decomp = false);
|
||||
|
||||
/// @}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue