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.

src/twaalgos/lbtt.cc

@@ -0,0 +1,146 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2011, 2012, 2013, 2014, 2015 Laboratoire de Recherche
+// et Développement de l'Epita (LRDE).
+// Copyright (C) 2003, 2004, 2005 Laboratoire d'Informatique de Paris
+// 6 (LIP6), département Systèmes Répartis Coopératifs (SRC),
+// Université Pierre et Marie Curie.
+//
+// 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 "lbtt.hh"
+#include <map>
+#include <string>
+#include <ostream>
+#include "twa/formula2bdd.hh"
+#include "reachiter.hh"
+#include "misc/bddlt.hh"
+#include "priv/accmap.hh"
+#include "ltlvisit/lbt.hh"
+#include "ltlparse/public.hh"
+
+namespace spot
+{
+  namespace
+  {
+    class lbtt_bfs : public tgba_reachable_iterator_breadth_first
+    {
+    public:
+      lbtt_bfs(const const_twa_ptr& a, std::ostream& os, bool sba_format)
+	: tgba_reachable_iterator_breadth_first(a),
+	  os_(os),
+	  sba_format_(sba_format),
+	  sba_(nullptr)
+      {
+	// Check if the automaton can be converted into a
+	// twa_graph. This makes the state_is_accepting() function
+	// more efficient.
+	if (a->is_sba())
+	  sba_ = std::dynamic_pointer_cast<const twa_graph>(a);
+      }
+
+      bool
+      state_is_accepting(const state *s) const
+      {
+	// If the automaton has a SBA type, it's easier to just query the
+	// state_is_accepting() method.
+	if (sba_)
+	  return sba_->state_is_accepting(s);
+
+	// Otherwise, since we are dealing with a degeneralized
+	// automaton nonetheless, the transitions leaving an accepting
+	// state are either all accepting, or all non-accepting.  So
+	// we just check the acceptance of the first transition.  This
+	// is not terribly efficient since we have to create the
+	// iterator.
+	twa_succ_iterator* it = aut_->succ_iter(s);
+	bool accepting = it->first()
+	  && aut_->acc().accepting(it->current_acceptance_conditions());
+	aut_->release_iter(it);
+	return accepting;
+      }
+
+
+      void
+      process_state(const state* s, int n, twa_succ_iterator*)
+      {
+	--n;
+	if (n == 0)
+	  body_ << "0 1";
+	else
+	  body_ << "-1\n" << n << " 0";
+	// Do we have state-based acceptance?
+	if (sba_format_)
+	  {
+	    // We support only one acceptance condition in the
+	    // state-based format.
+	    if (state_is_accepting(s))
+	      body_ << " 0 -1";
+	    else
+	      body_ << " -1";
+	  }
+	body_ << '\n';
+      }
+
+      void
+      process_link(const state*, int,
+		   const state*, int out, const twa_succ_iterator* si)
+      {
+	body_ << out - 1 << ' ';
+	if (!sba_format_)
+	  {
+	    for (auto s: aut_->acc().sets(si->current_acceptance_conditions()))
+	      body_ << s << ' ';
+	    body_ << "-1 ";
+	  }
+	const ltl::formula* f = bdd_to_formula(si->current_condition(),
+					       aut_->get_dict());
+	to_lbt_string(f, body_);
+	f->destroy();
+	body_ << '\n';
+      }
+
+      void
+      end()
+      {
+	os_ << seen.size() << ' ';
+	if (sba_format_)
+	  os_ << '1';
+	else
+	  os_ << aut_->acc().num_sets() << 't';
+	os_ << '\n' << body_.str() << "-1" << std::endl;
+      }
+
+    private:
+      std::ostream& os_;
+      std::ostringstream body_;
+      bdd all_acc_conds_;
+      bool sba_format_;
+      const_twa_graph_ptr sba_;
+    };
+  }
+
+  std::ostream&
+  lbtt_reachable(std::ostream& os, const const_twa_ptr& g, bool sba)
+  {
+    if (!g->acc().is_generalized_buchi())
+      throw std::runtime_error
+	("LBTT only supports generalized Büchi acceptance");
+
+    lbtt_bfs b(g, os, sba);
+    b.run();
+    return os;
+  }
+}