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

* src/tgbaalgos/gtec/status.hh

Browse source 
(couvreur99_check_status::cycle_seed): New attribute.
* src/tgbaalgos/gtec/gtec.cc (couvreur99_check::check,
couvreur99_check_shy::check): Fill cycle_seed.
* src/tgbaalgos/gtec/ce.hh, src/tgbaalgos/gtec/ce.cc:
(couvreur99_check_result::accepting_run,
couvreur99_check_result::accepting_cycle): Revamp to compute a
cycle from the cycle_start, and then the shortest prefix to this
cycle.
This commit is contained in:
Alexandre Duret-Lutz 2004-12-10 18:33:39 +00:00
parent 27966c28f0
commit abbd0eee07
8 changed files with 154 additions and 139 deletions
Download patch file Download diff file Expand all files Collapse all files

11
src/tgbaalgos/gtec/ce.hh
View file

@ -23,7 +23,6 @@
# define SPOT_TGBAALGOS_GTEC_CE_HH
#include "status.hh"
#include "explscc.hh"
#include "tgbaalgos/emptiness.hh"
namespace spot
@ -32,11 +31,7 @@ namespace spot
class couvreur99_check_result: public emptiness_check_result
{
public:
couvreur99_check_result(const couvreur99_check_status* ecs,
const explicit_connected_component_factory*
eccf =
connected_component_hash_set_factory::instance());
couvreur99_check_result(const couvreur99_check_status* ecs);
virtual tgba_run* accepting_run();
@ -45,12 +40,10 @@ namespace spot
protected:
/// Called by accepting_run() to find a cycle which traverses all
/// acceptance conditions in the accepted SCC.
void accepting_cycle(const explicit_connected_component* scc,
const state* start, bdd acc_to_traverse);
void accepting_cycle();
private:
const couvreur99_check_status* ecs_;
const explicit_connected_component_factory* eccf_;
tgba_run* run_;
};
}