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

* src/ltltest/reduc.cc (main): More cases to test.

Browse source 
* src/ltlvisit/basicreduce.cc (basic_reduce_visitor::visit):
Simplify the formula again after FX->XF and GX->XG permutations.
This is so that formulae like GFXXa become GFa and not just GFXa.
* src/ltlvisit/contain.cc (reduce_tau03_visitor): Fix a typo
in the rules for i|j or i&j, resulting in missing simplifications.
This commit is contained in:
Alexandre Duret-Lutz 2007-04-19 16:45:51 +00:00
parent b1c820af4d
commit 78d37fa126
4 changed files with 46 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

6
src/ltlvisit/contain.cc
View file

@ -30,8 +30,6 @@
#include "tgba/tgbaproduct.hh"
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/save.hh"
#include "tostring.hh"
#include <iostream>
namespace spot
{
namespace ltl
@ -269,7 +267,7 @@ namespace spot
break;
}
// if j => i, then i|j = i
else if (lcc->contained((*res)[i], (*res)[j]))
else if (lcc->contained((*res)[j], (*res)[i]))
{
destroy((*res)[j]);
(*res)[j] = 0;
@ -301,7 +299,7 @@ namespace spot
changed = true;
}
// if j => i, then i&j = j
else if (lcc->contained((*res)[i], (*res)[j]))
else if (lcc->contained((*res)[j], (*res)[i]))
{
destroy((*res)[i]);
(*res)[i] = 0;