Store membership to acceptance sets using bitsets, not BDDs.
This is a huge patch, that took over a month to complete. The bit sets are currently restricted to what 'unsigned can store', but it should be easy to extend it to 'uint64_t' should we need it. * NEWS: Update. * src/tgba/acc.hh: New file. * src/tgbatest/acc.cc, src/tgbatest/acc.test: Test it. * src/tgba/tgbakvcomplement.cc, src/tgba/tgbakvcomplement.hh, src/tgba/tgbasgba.cc, src/tgba/tgbasgba.hh: Delete. The KV complementation is too slow to be used in practice, and I somehow broke it during the conversion to bitsets. The tgba->sgba conversion was only used for the KV complementation, and should be better redone on tgba_digraph_ptr should it be needed again. * src/bin/ltlcross.cc, src/dstarparse/dra2ba.cc, src/dstarparse/nsa2tgba.cc, src/graphtest/tgbagraph.cc, src/graphtest/tgbagraph.test, src/kripke/fairkripke.cc, src/kripke/fairkripke.hh, src/kripke/kripke.cc, src/kripke/kripke.hh, src/kripke/kripkeexplicit.cc, src/kripke/kripkeexplicit.hh, src/misc/hash.hh, src/neverparse/neverclaimparse.yy, src/priv/accmap.hh, src/ta/ta.cc, src/ta/ta.hh, src/ta/taexplicit.cc, src/ta/taexplicit.hh, src/ta/taproduct.cc, src/ta/taproduct.hh, src/ta/tgta.cc, src/ta/tgta.hh, src/ta/tgtaexplicit.cc, src/ta/tgtaexplicit.hh, src/ta/tgtaproduct.cc, src/ta/tgtaproduct.hh, src/taalgos/dotty.cc, src/taalgos/emptinessta.cc, src/taalgos/minimize.cc, src/taalgos/tgba2ta.cc, src/tgba/Makefile.am, src/tgba/fwd.hh, src/tgba/taatgba.cc, src/tgba/taatgba.hh, src/tgba/tgba.cc, src/tgba/tgba.hh, src/tgba/tgbagraph.cc, src/tgba/tgbagraph.hh, src/tgba/tgbamask.cc, src/tgba/tgbamask.hh, src/tgba/tgbaproduct.cc, src/tgba/tgbaproduct.hh, src/tgba/tgbaproxy.cc, src/tgba/tgbaproxy.hh, src/tgba/tgbasafracomplement.cc, src/tgba/tgbasafracomplement.hh, src/tgbaalgos/bfssteps.cc, src/tgbaalgos/complete.cc, src/tgbaalgos/compsusp.cc, src/tgbaalgos/degen.cc, src/tgbaalgos/dotty.cc, src/tgbaalgos/dtbasat.cc, src/tgbaalgos/dtgbacomp.cc, src/tgbaalgos/dtgbasat.cc, src/tgbaalgos/dupexp.cc, src/tgbaalgos/emptiness.cc, src/tgbaalgos/emptiness.hh, src/tgbaalgos/gtec/ce.cc, src/tgbaalgos/gtec/gtec.cc, src/tgbaalgos/gtec/gtec.hh, src/tgbaalgos/gtec/sccstack.cc, src/tgbaalgos/gtec/sccstack.hh, src/tgbaalgos/gv04.cc, src/tgbaalgos/hoaf.cc, src/tgbaalgos/isweakscc.cc, src/tgbaalgos/lbtt.cc, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/magic.cc, src/tgbaalgos/ndfs_result.hxx, src/tgbaalgos/neverclaim.cc, src/tgbaalgos/postproc.cc, src/tgbaalgos/powerset.cc, src/tgbaalgos/randomgraph.cc, src/tgbaalgos/randomgraph.hh, src/tgbaalgos/reducerun.cc, src/tgbaalgos/replayrun.cc, src/tgbaalgos/safety.cc, src/tgbaalgos/save.cc, src/tgbaalgos/scc.cc, src/tgbaalgos/scc.hh, src/tgbaalgos/sccfilter.cc, src/tgbaalgos/sccinfo.cc, src/tgbaalgos/sccinfo.hh, src/tgbaalgos/se05.cc, src/tgbaalgos/simulation.cc, src/tgbaalgos/simulation.hh, src/tgbaalgos/stats.cc, src/tgbaalgos/stripacc.cc, src/tgbaalgos/tau03.cc, src/tgbaalgos/tau03opt.cc, src/tgbaalgos/weight.cc, src/tgbaalgos/weight.hh, src/tgbaparse/tgbaparse.yy, src/tgbatest/Makefile.am, src/tgbatest/complementation.cc, src/tgbatest/complementation.test, src/tgbatest/degenlskip.test, src/tgbatest/det.test, src/tgbatest/dstar.test, src/tgbatest/emptchk.cc, src/tgbatest/explpro2.test, src/tgbatest/explpro3.test, src/tgbatest/explpro4.test, src/tgbatest/explprod.test, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltl2tgba.test, src/tgbatest/maskacc.cc, src/tgbatest/maskacc.test, src/tgbatest/neverclaimread.test, src/tgbatest/randtgba.cc, src/tgbatest/readsave.test, src/tgbatest/sim.test, src/tgbatest/sim2.test, src/tgbatest/spotlbtt.test, src/tgbatest/tgbaread.test, src/tgbatest/tripprod.test, iface/dve2/dve2.cc: Adjust or use to the new acceptance interface.
This commit is contained in:
parent
37ece2b878
commit
2c764fb3c7
125 changed files with 1950 additions and 3254 deletions
|
|
@ -34,10 +34,9 @@ namespace spot
|
|||
bdd_dict_ptr dict_;
|
||||
tgba_digraph_ptr aut_;
|
||||
ltl::environment& env_;
|
||||
bdd neg_;
|
||||
|
||||
acc_mapper_common(const tgba_digraph_ptr& aut, ltl::environment& env)
|
||||
: dict_(aut->get_dict()), aut_(aut), env_(env), neg_(bddtrue)
|
||||
: dict_(aut->get_dict()), aut_(aut), env_(env)
|
||||
{
|
||||
}
|
||||
|
||||
|
|
@ -46,17 +45,11 @@ namespace spot
|
|||
{
|
||||
return env_;
|
||||
}
|
||||
|
||||
// Commit all acceptance set to the automaton.
|
||||
void commit()
|
||||
{
|
||||
aut_->set_acceptance_conditions(neg_);
|
||||
}
|
||||
};
|
||||
|
||||
class acc_mapper_string: public acc_mapper_common
|
||||
{
|
||||
std::unordered_map<std::string, int> map_;
|
||||
std::unordered_map<std::string, unsigned> map_;
|
||||
|
||||
public:
|
||||
acc_mapper_string(const tgba_digraph_ptr& aut,
|
||||
|
|
@ -72,24 +65,17 @@ namespace spot
|
|||
auto i = map_.find(name);
|
||||
if (i != map_.end())
|
||||
return true;
|
||||
auto f = env_.require(name);
|
||||
if (!f)
|
||||
return false;
|
||||
int v = dict_->register_acceptance_variable(f, aut_);
|
||||
f->destroy();
|
||||
auto v = aut_->acc().add_set();
|
||||
map_[name] = v;
|
||||
neg_ &= bdd_nithvar(v);
|
||||
return true;
|
||||
}
|
||||
|
||||
std::pair<bool, bdd> lookup(std::string name) const
|
||||
std::pair<bool, acc_cond::mark_t> lookup(std::string name) const
|
||||
{
|
||||
auto p = map_.find(name);
|
||||
if (p == map_.end())
|
||||
return std::make_pair(false, bddfalse);
|
||||
return std::make_pair(true, bdd_compose(neg_,
|
||||
bdd_nithvar(p->second),
|
||||
p->second));
|
||||
return std::make_pair(false, 0U);
|
||||
return std::make_pair(true, aut_->acc().marks({p->second}));
|
||||
}
|
||||
};
|
||||
|
||||
|
|
@ -97,42 +83,23 @@ namespace spot
|
|||
// The acceptance sets are named using count consecutive integers.
|
||||
class acc_mapper_consecutive_int: public acc_mapper_common
|
||||
{
|
||||
protected:
|
||||
std::vector<bdd> vec_;
|
||||
std::map<int, bdd> map_;
|
||||
|
||||
public:
|
||||
acc_mapper_consecutive_int(const tgba_digraph_ptr& aut,
|
||||
unsigned count,
|
||||
ltl::environment& env =
|
||||
ltl::default_environment::instance())
|
||||
: acc_mapper_common(aut, env), vec_(count)
|
||||
: acc_mapper_common(aut, env)
|
||||
{
|
||||
std::vector<int> vmap(count);
|
||||
for (unsigned n = 0; n < count; ++n)
|
||||
{
|
||||
std::ostringstream s;
|
||||
s << n;
|
||||
auto f = env.require(s.str());
|
||||
int v = dict_->register_acceptance_variable(f, aut_);
|
||||
f->destroy();
|
||||
vmap[n] = v;
|
||||
neg_ &= bdd_nithvar(v);
|
||||
}
|
||||
for (unsigned n = 0; n < count; ++n)
|
||||
{
|
||||
int v = vmap[n];
|
||||
vec_[n] = bdd_compose(neg_, bdd_nithvar(v), v);
|
||||
}
|
||||
commit();
|
||||
std::vector<unsigned> vmap(count);
|
||||
aut->acc().add_sets(count);
|
||||
}
|
||||
|
||||
std::pair<bool, bdd> lookup(unsigned n)
|
||||
std::pair<bool, acc_cond::mark_t> lookup(unsigned n)
|
||||
{
|
||||
if (n < vec_.size())
|
||||
return std::make_pair(true, vec_[n]);
|
||||
if (n < aut_->acc().num_sets())
|
||||
return std::make_pair(true, aut_->acc().marks({n}));
|
||||
else
|
||||
return std::make_pair(false, bddfalse);
|
||||
return std::make_pair(false, 0U);
|
||||
}
|
||||
};
|
||||
|
||||
|
|
@ -141,7 +108,7 @@ namespace spot
|
|||
class acc_mapper_int: public acc_mapper_consecutive_int
|
||||
{
|
||||
unsigned used_;
|
||||
std::map<int, bdd> map_;
|
||||
std::map<unsigned, acc_cond::mark_t> map_;
|
||||
|
||||
public:
|
||||
acc_mapper_int(const tgba_digraph_ptr& aut,
|
||||
|
|
@ -152,18 +119,18 @@ namespace spot
|
|||
{
|
||||
}
|
||||
|
||||
std::pair<bool, bdd> lookup(unsigned n)
|
||||
std::pair<bool, acc_cond::mark_t> lookup(unsigned n)
|
||||
{
|
||||
auto p = map_.find(n);
|
||||
if (p != map_.end())
|
||||
return std::make_pair(true, p->second);
|
||||
if (used_ < vec_.size())
|
||||
if (used_ < aut_->acc().num_sets())
|
||||
{
|
||||
bdd res = vec_[used_++];
|
||||
auto res = aut_->acc().marks({used_++});
|
||||
map_[n] = res;
|
||||
return std::make_pair(true, res);
|
||||
}
|
||||
return std::make_pair(false, bddfalse);
|
||||
return std::make_pair(false, 0U);
|
||||
}
|
||||
};
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue