rename src/tgbaalgos/ as src/twaalgos/

Automatic mass renaming. * src/tgbaalgos/: Rename as... * src/twaalgos/: ... this. * README, configure.ac, iface/ltsmin/modelcheck.cc, src/Makefile.am, src/bin/autfilt.cc, src/bin/common_aoutput.cc, src/bin/common_aoutput.hh, src/bin/common_output.hh, src/bin/common_post.hh, src/bin/dstar2tgba.cc, src/bin/ltl2tgba.cc, src/bin/ltl2tgta.cc, src/bin/ltlcross.cc, src/bin/ltldo.cc, src/bin/ltlfilt.cc, src/bin/randaut.cc, src/dstarparse/dra2ba.cc, src/dstarparse/nra2nba.cc, src/dstarparse/nsa2tgba.cc, src/graphtest/twagraph.cc, src/kripke/kripkeprint.cc, src/ltlvisit/contain.cc, src/ltlvisit/contain.hh, src/ltlvisit/exclusive.cc, src/taalgos/emptinessta.hh, src/tgbatest/checkpsl.cc, src/tgbatest/checkta.cc, src/tgbatest/complementation.cc, src/tgbatest/emptchk.cc, src/tgbatest/ltl2tgba.cc, src/tgbatest/ltlprod.cc, src/tgbatest/randtgba.cc, src/tgbatest/taatgba.cc, src/twa/twa.cc, src/twa/twagraph.hh, src/twa/twasafracomplement.cc, wrap/python/spot_impl.i: Adjust.
2015-04-22 17:52:27 +02:00 · 2015-04-22 17:52:27 +02:00 · de529df59f
commit de529df59f
parent 703fbd0e99
159 changed files with 260 additions and 272 deletions
--- a/src/twaalgos/word.cc
+++ b/src/twaalgos/word.cc
@ -0,0 +1,110 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
+// de l'Epita (LRDE).
+//
+// This file is part of Spot, a model checking library.
+//
+// Spot is free software; you can redistribute it and/or modify it
+// under the terms of the GNU General Public License as published by
+// the Free Software Foundation; either version 3 of the License, or
+// (at your option) any later version.
+//
+// Spot is distributed in the hope that it will be useful, but WITHOUT
+// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
+// License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+#include "word.hh"
+#include "twa/bddprint.hh"
+#include "twa/bdddict.hh"
+
+namespace spot
+{
+  tgba_word::tgba_word(const tgba_run_ptr run)
+  {
+    for (tgba_run::steps::const_iterator i = run->prefix.begin();
+	 i != run->prefix.end(); ++i)
+      prefix.push_back(i->label);
+    for (tgba_run::steps::const_iterator i = run->cycle.begin();
+	 i != run->cycle.end(); ++i)
+      cycle.push_back(i->label);
+  }
+
+  void
+  tgba_word::simplify()
+  {
+    // If all the formulas on the cycle are compatible, reduce the
+    // cycle to a simple conjunction.
+    //
+    // For instance
+    //   !a|!b; b; a&b; cycle{a; b; a&b}
+    // can be reduced to
+    //   !a|!b; b; a&b; cycle{a&b}
+    {
+      bdd all = bddtrue;
+      for (seq_t::const_iterator i = cycle.begin(); i != cycle.end(); ++i)
+	all &= *i;
+      if (all != bddfalse)
+	{
+	  cycle.clear();
+	  cycle.push_back(all);
+	}
+    }
+    // If the last formula of the prefix is compatible with the
+    // last formula of the cycle, we can shift the cycle and
+    // reduce the prefix.
+    //
+    // For instance
+    //   !a|!b; b; a&b; cycle{a&b}
+    // can be reduced to
+    //   !a|!b; cycle{a&b}
+    while (!prefix.empty())
+      {
+	bdd a = prefix.back() & cycle.back();
+	if (a == bddfalse)
+	  break;
+	prefix.pop_back();
+	cycle.pop_back();
+	cycle.push_front(a);
+      }
+    // Get rid of any disjunction.
+    //
+    // For instance
+    //   !a|!b; cycle{a&b}
+    // can be reduced to
+    //   !a&!b; cycle{a&b}
+    for (seq_t::iterator i = prefix.begin(); i != prefix.end(); ++i)
+      *i = bdd_satone(*i);
+    for (seq_t::iterator i = cycle.begin(); i != cycle.end(); ++i)
+      *i = bdd_satone(*i);
+
+  }
+
+  std::ostream&
+  tgba_word::print(std::ostream& os, const bdd_dict_ptr& d) const
+  {
+    if (!prefix.empty())
+      for (seq_t::const_iterator i = prefix.begin(); i != prefix.end(); ++i)
+	{
+	  bdd_print_formula(os, d, *i);
+	  os << "; ";
+	}
+    assert(!cycle.empty());
+    bool notfirst = false;
+    os << "cycle{";
+    for (seq_t::const_iterator i = cycle.begin(); i != cycle.end(); ++i)
+      {
+	if (notfirst)
+	  os << "; ";
+	notfirst = true;
+	bdd_print_formula(os, d, *i);
+      }
+    os << '}';
+    return os;
+  }
+
+
+}