Check that reductions are legitimates with containment.
* src/ltlvisit/simplify.cc, src/ltlvisit/simplify.hh (are_equivalent): Export this function from the cache. * src/ltltest/reduc.cc, src/ltltest/equals.cc: Use are_equivalent() to check that the reductions are legitimate.
This commit is contained in:
parent
cd9369c186
commit
7f7627bf22
4 changed files with 100 additions and 55 deletions
|
|
@ -244,7 +244,8 @@ namespace spot
|
|||
// If right==false, true if !f1 => f2, false otherwise.
|
||||
// If right==true, true if f1 => !f2, false otherwise.
|
||||
bool
|
||||
syntactic_implication_neg(const formula* f1, const formula* f2, bool right);
|
||||
syntactic_implication_neg(const formula* f1, const formula* f2,
|
||||
bool right);
|
||||
|
||||
// Return true if f1 => !f2
|
||||
bool contained_neg(const formula* f1, const formula* f2)
|
||||
|
|
@ -2862,11 +2863,17 @@ namespace spot
|
|||
}
|
||||
|
||||
bool
|
||||
ltl_simplifier::syntactic_implication_neg(const formula* f1, const formula* f2,
|
||||
bool right)
|
||||
ltl_simplifier::syntactic_implication_neg(const formula* f1,
|
||||
const formula* f2, bool right)
|
||||
{
|
||||
return cache_->syntactic_implication_neg(f1, f2, right);
|
||||
}
|
||||
|
||||
bool
|
||||
ltl_simplifier::are_equivalent(const formula* f, const formula* g)
|
||||
{
|
||||
return cache_->lcc.equal(f, g);
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue