Before this change, all automata would construct their own
dictionaries (map of BDD variables to LTL formulae). This was cumbersome, because to multiply two automata we had to build a common dictionary (the union of the two LTL formula spaces), and install wrappers to translate each automaton's BDD answers into the common dictionary. This translation, that had to be repeated when several products were nested, was time consuming and was a hindrance for some optimizations. In the new scheme, all automata involved in a product must share the same dictionary. An empty dictionary should be constructed by the user and passed to the automaton' constructors as necessary. This huge change removes most code than it adds. * src/Makefile.am (libspot_la_LIBADD): Add misc/libmisc.la. * src/misc/bddalloc.hh, src/misc/bddalloc.cc: New files. These partly replace src/tgba/bddfactory.hh and src/tgba/bddfactory.cc. * src/misc/Makefile.am: Adjust to build bddalloc.hh and bddalloc.cc. * src/tgba/bddfactory.hh, src/tgba/bddfactory.cc, src/tgba/dictunion.hh, src/tgba/dictunion.cc, src/tgba/tgbabdddict.hh, src/tgba/tgbabdddict.cc, src/tgba/tgbabddtranslatefactory.hh, src/tgba/tgbabddtranslatefactory.cc, src/tgba/tgbatranslateproxy.hh, src/tgba/tgbatranslateproxy.cc: Delete. * src/tgba/bdddict.hh, src/tgba/bdddict.cc: New files. These replaces tgbabdddict.hh and tgbabdddict.cc, and also part of bddfactory.hh and bddfactory.cc. * src/tgba/bddprint.cc, src/tgba/bddprint.hh: Adjust to use bdd_dict* instead of tgba_bdd_dict&. * src/tgba/succiterconcrete.cc (succ_iter_concrete::next()): Get next_to_now from the dictionary. * src/tgba/tgba.hh (tgba::get_dict): Return a bdd_dict*, not a const tgba_bdd_dict*. * src/tgba/tgbabddconcrete.cc, src/tgba/tgbabddconcrete.hh: Adjust to use the new dictionary, stored in data_. * src/tgba/tgbabddconcretefactory.cc, src/tgba/tgbabddconcretefactory.hh: Likewise. Plus now_to_next_ is now also stored in the dictionary. * src/tgba/tgbabddconcreteproduct.cc: Likewise. Now that both operand share the same product, there is not point in using tgba_bdd_translate_factory. * src/tgba/tgbabddcoredata.cc, src/tgba/tgbabddcoredata.hh: Store a bdd_dict (taken as constructor argument). (tgba_bdd_core_data::~tgba_bdd_core_data): Remove. (tgba_bdd_core_data::translate): Remove. (tgba_bdd_core_data::next_to_now): Remove (now in dict). (tgba_bdd_core_data::dict): New pointer. * src/tgba/tgbabddfactory.hh: (tgba_bdd_factory::get_dict): Remove. * src/tgba/tgbaexplicit.cc, src/tgba/tgbaexplicit.hh: Adjust to use the new dictionary. * src/tgba/tgbaproduct.cc, src/tgba/tgbaproduct.hh: Likewise. Do not use tgba_bdd_dict_union and tgba_bdd_translate_proxy anymore. * src/tgbaalgos/lbtt.cc, src/tgbaalgos/save.cc: Adjust to use bdd_dict* instead of tgba_bdd_dict&. * src/tgbaalgos/ltl2tgba.cc, src/tgbaalgos/ltl2tgba.cc: Likewise. (ltl_to_tgba): Take a dict argument. * src/tgbaparse/public.hh (tgba_parse): Take a dict argument. * src/tgbaparse/tgbaparse.yy (tgba_parse): Take a dict argument. * src/tgbatest/explicit.cc, src/tgbatest/explprod.cc, src/tgbatest/ltlprod.cc, src/tgbatest/mixprod.cc, src/tgbatest/readsave.cc, src/tgbatest/spotlbtt.cc, src/tgbatest/tgbaread.cc, src/tgbatest/tripprod.cc: Instantiate a dictionary, and pass it to the automata' constructors. * src/tgbatest/ltl2tgba.cc: Likewise, and remove the -o (defrag) option. * iface/gspn/gspn.hh (tgba_gspn::tgba_gspn): Take a bdd_dict argument. (tgba_gspn::get_dict): Adjust return type. * iface/gspn/gspn.cc: Do not use bdd_factory, adjust to use the new dictionary instead.
This commit is contained in:
Alexandre Duret-Lutz
parent
3013ba8da6
commit
cab3be9795
52 changed files with 930 additions and 1034 deletions
|
|
@ -3,8 +3,8 @@
|
|||
#include "tgbabddconcretefactory.hh"
|
||||
namespace spot
|
||||
{
|
||||
tgba_bdd_concrete_factory::tgba_bdd_concrete_factory()
|
||||
: now_to_next_(bdd_newpair())
|
||||
tgba_bdd_concrete_factory::tgba_bdd_concrete_factory(bdd_dict* dict)
|
||||
: data_(dict)
|
||||
{
|
||||
}
|
||||
|
||||
|
|
@ -13,50 +13,26 @@ namespace spot
|
|||
acc_map_::iterator ai;
|
||||
for (ai = acc_.begin(); ai != acc_.end(); ++ai)
|
||||
destroy(ai->first);
|
||||
get_dict()->unregister_all_my_variables(this);
|
||||
}
|
||||
|
||||
int
|
||||
tgba_bdd_concrete_factory::create_state(const ltl::formula* f)
|
||||
{
|
||||
// Do not build a state that already exists.
|
||||
tgba_bdd_dict::fv_map::iterator sii = dict_.now_map.find(f);
|
||||
if (sii != dict_.now_map.end())
|
||||
return sii->second;
|
||||
|
||||
f = clone(f);
|
||||
|
||||
int num = create_pair();
|
||||
dict_.now_map[f] = num;
|
||||
dict_.now_formula_map[num] = f;
|
||||
|
||||
// Record that num+1 should be renamed as num when
|
||||
// the next state becomes current.
|
||||
bdd_setpair(data_.next_to_now, num + 1, num);
|
||||
bdd_setpair(now_to_next_, num, num + 1);
|
||||
|
||||
int num = get_dict()->register_state(f, this);
|
||||
// Keep track of all "Now" variables for easy
|
||||
// existential quantification.
|
||||
data_.declare_now_next (ithvar(num), ithvar(num + 1));
|
||||
data_.declare_now_next (bdd_ithvar(num), bdd_ithvar(num + 1));
|
||||
return num;
|
||||
}
|
||||
|
||||
int
|
||||
tgba_bdd_concrete_factory::create_atomic_prop(const ltl::formula* f)
|
||||
{
|
||||
// Do not build a variable that already exists.
|
||||
tgba_bdd_dict::fv_map::iterator sii = dict_.var_map.find(f);
|
||||
if (sii != dict_.var_map.end())
|
||||
return sii->second;
|
||||
|
||||
f = clone(f);
|
||||
|
||||
int num = create_node();
|
||||
dict_.var_map[f] = num;
|
||||
dict_.var_formula_map[num] = f;
|
||||
|
||||
int num = get_dict()->register_proposition(f, this);
|
||||
// Keep track of all atomic proposition for easy
|
||||
// existential quantification.
|
||||
data_.declare_atomic_prop(ithvar(num));
|
||||
data_.declare_atomic_prop(bdd_ithvar(num));
|
||||
return num;
|
||||
}
|
||||
|
||||
|
|
@ -86,18 +62,14 @@ namespace spot
|
|||
for (ai = acc_.begin(); ai != acc_.end(); ++ai)
|
||||
{
|
||||
// Register a BDD variable for this accepting condition.
|
||||
int a = create_node();
|
||||
const ltl::formula* f = clone(ai->first); // The associated formula.
|
||||
dict_.acc_map[f] = a;
|
||||
dict_.acc_formula_map[a] = f;
|
||||
bdd acc = ithvar(a);
|
||||
int num = get_dict()->register_accepting_variable(ai->first, this);
|
||||
// Keep track of all accepting conditions for easy
|
||||
// existential quantification.
|
||||
data_.declare_accepting_condition(acc);
|
||||
data_.declare_accepting_condition(bdd_ithvar(num));
|
||||
}
|
||||
for (ai = acc_.begin(); ai != acc_.end(); ++ai)
|
||||
{
|
||||
bdd acc = ithvar(dict_.acc_map[ai->first]);
|
||||
bdd acc = bdd_ithvar(get_dict()->acc_map[ai->first]);
|
||||
|
||||
// Complete acc with all the other accepting conditions negated.
|
||||
acc &= bdd_exist(data_.negacc_set, acc);
|
||||
|
|
@ -119,7 +91,7 @@ namespace spot
|
|||
// state: the combination exists but won't allow further exploration
|
||||
// because it fails the constraints.)
|
||||
data_.relation &= bdd_replace(bdd_exist(data_.relation, data_.notnow_set),
|
||||
now_to_next_);
|
||||
get_dict()->now_to_next);
|
||||
}
|
||||
|
||||
const tgba_bdd_core_data&
|
||||
|
|
@ -128,10 +100,10 @@ namespace spot
|
|||
return data_;
|
||||
}
|
||||
|
||||
const tgba_bdd_dict&
|
||||
bdd_dict*
|
||||
tgba_bdd_concrete_factory::get_dict() const
|
||||
{
|
||||
return dict_;
|
||||
return data_.dict;
|
||||
}
|
||||
|
||||
void
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue