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

* src/ltlvisit/contain.cc (reduce_tau03_visitor): Simplify the

Browse source 
rules for "a U b" and "a R b", an implication check is enough.
This commit is contained in:
Alexandre Duret-Lutz 2007-04-19 12:10:22 +00:00
parent 21e2439d06
commit b1c820af4d
2 changed files with 10 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

5
ChangeLog
View file

@ -1,3 +1,8 @@
2007-04-19 Alexandre Duret-Lutz <adl@gnu.org>
* src/ltlvisit/contain.cc (reduce_tau03_visitor): Simplify the
rules for "a U b" and "a R b", an implication check is enough.
2007-04-17 Alexandre Duret-Lutz <adl@gnu.org>
* src/misc/bddalloc.cc (bdd_allocator::initialize): Call

10
src/ltlvisit/contain.cc
View file

@ -1,4 +1,4 @@
// Copyright (C) 2006 Laboratoire d'Informatique de Paris 6 (LIP6),
// Copyright (C) 2006, 2007 Laboratoire d'Informatique de Paris 6 (LIP6),
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
// et Marie Curie.
//
@ -181,8 +181,8 @@ namespace spot
switch (bo->op())
{
case binop::U:
// if (a U b) = b, then keep b !
if (stronger && lcc->equal(bo, b))
// if (a U b) => b, then keep b !
if (stronger && lcc->contained(bo, b))
{
destroy(a);
result_ = b;
@ -205,8 +205,8 @@ namespace spot
}
break;
case binop::R:
// if (a R b) = b, then keep b !
if (stronger && lcc->equal(bo, b))
// if (a R b) => b, then keep b !
if (stronger && lcc->contained(b, bo))
{
destroy(a);
result_ = b;