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

* src/tgba/tgbatba.cc (tgba_tba_proxy_succ_iterator::current_state):

Browse source 
Fix reference to Oddoux's thesis.
This commit is contained in:
Alexandre Duret-Lutz 2004-02-19 15:46:30 +00:00
parent 4e793ef418
commit 3350ff7176
3 changed files with 17 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

5
ChangeLog
View file

@ -1,3 +1,8 @@
2004-02-19 Alexandre Duret-Lutz <adl@src.lip6.fr>
* src/tgba/tgbatba.cc (tgba_tba_proxy_succ_iterator::current_state):
Fix reference to Oddoux's thesis.
2004-02-16 Alexandre Duret-Lutz <adl@src.lip6.fr> 2004-02-16 Alexandre Duret-Lutz <adl@src.lip6.fr>
* src/tgbaalgos/ltl2tgba_fm.hh (ltl_to_tgba_fm): Add the * src/tgbaalgos/ltl2tgba_fm.hh (ltl_to_tgba_fm): Add the

16
src/tgba/tgbatba.cc
View file

@ -153,15 +153,15 @@ namespace spot
// to the next acceptance set. If the current transition is also // to the next acceptance set. If the current transition is also
// in the next acceptance set, then go the one after, etc. // in the next acceptance set, then go the one after, etc.
// //
// Jérôme Leroux's PhD thesis has a nice explanation of how it // See Denis Oddoux's PhD thesis for a nice explanation (in French).
// works, chapter 6. // @PhDThesis{ oddoux.03.phd,
// @PhDThesis{ leroux.03.phd, // author = {Denis Oddoux},
// author = {J{\'e}r{\^o}me Leroux}, // title = {Utilisation des automates alternants pour un
// title = {Algorithmique de la v{\'e}rification des syst{\`e}mes // model-checking efficace des logiques temporelles
// {\`a} compteurs. Approximation et acc{\'e}l{\'e}ration. // lin{\'e}aires.},
// Impl{\'e}mentation de l'outil {\sc Fast}}, // school = {Universit{\'e}e Paris 7},
// school = {{\'E}cole Normale Sup{\'e}rieure de Cachan},
// year = {2003}, // year = {2003},
// address = {Paris, France},
// month = {December} // month = {December}
// } // }
// //

10
src/tgbaalgos/ltl2tgba_fm.cc
View file

@ -570,10 +570,6 @@ namespace spot
// way it will be explored before the other during the model // way it will be explored before the other during the model
// checking. // checking.
dest_map::const_iterator i = dests.find(constant::true_instance()); dest_map::const_iterator i = dests.find(constant::true_instance());
// conditions of the True arc, so when can remove them from
// all other arcs. This is not needed when exprop is used,
// but it does not hurt.
bdd cond_for_true = bddfalse;
if (i != dests.end()) if (i != dests.end())
{ {
// Transitions going to True are not expected to make any promises. // Transitions going to True are not expected to make any promises.
@ -581,10 +577,9 @@ namespace spot
prom_map::const_iterator j = i->second.find(bddtrue); prom_map::const_iterator j = i->second.find(bddtrue);
assert(j != i->second.end()); assert(j != i->second.end());
cond_for_true = j->second;
tgba_explicit::transition* t = tgba_explicit::transition* t =
a->create_transition(now, constant::true_instance()->val_name()); a->create_transition(now, constant::true_instance()->val_name());
a->add_condition(t, d.bdd_to_formula(cond_for_true)); a->add_condition(t, d.bdd_to_formula(j->second));
} }
// Register other transitions. // Register other transitions.
@ -600,8 +595,7 @@ namespace spot
{ {
tgba_explicit::transition* t = tgba_explicit::transition* t =
a->create_transition(now, next); a->create_transition(now, next);
a->add_condition(t, d.bdd_to_formula(j->second a->add_condition(t, d.bdd_to_formula(j->second));
- cond_for_true));
d.conj_bdd_to_acc(a, j->first, t); d.conj_bdd_to_acc(a, j->first, t);
} }
} }