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

rules for "a U b" and "a R b", an implication check is enough.

ChangeLog

+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

src/ltlvisit/contain.cc

-// Copyright (C) 2006 Laboratoire d'Informatique de Paris 6 (LIP6),
+// Copyright (C) 2006, 2007 Laboratoire d'Informatique de Paris 6 (LIP6),
 // dpartement Systmes Rpartis Coopratifs (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;