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/tau03.hh

@@ -0,0 +1,101 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement de
+// l'Epita (LRDE).
+// Copyright (C) 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/>.
+
+#pragma once
+
+#include "misc/optionmap.hh"
+#include "twa/fwd.hh"
+#include "emptiness.hh"
+
+namespace spot
+{
+  /// \addtogroup emptiness_check_algorithms
+  /// @{
+
+  /// \brief Returns an emptiness checker on the spot::tgba automaton \a a.
+  ///
+  /// \pre The automaton \a a must have at least one acceptance condition.
+  ///
+  /// During the visit of \a a, the returned checker stores explicitely all
+  /// the traversed states. The implemented algorithm is the following:
+  ///
+  /** \verbatim
+      procedure check ()
+      begin
+        call dfs_blue(s0);
+      end;
+
+      procedure dfs_blue (s)
+      begin
+        s.color = blue;
+        s.acc = emptyset;
+        for all t in post(s) do
+          if t.color == white then
+            call dfs_blue(t);
+          end if;
+        end for;
+        for all t in post(s) do
+          let (s, l, a, t) be the edge from s to t;
+          if s.acc U a not included in t.acc then
+            call dfs_red(t, a U s.acc);
+          end if;
+        end for;
+        if s.acc == all_acc then
+          report a cycle;
+        end if;
+      end;
+
+      procedure dfs_red(s, A)
+      begin
+        s.acc = s.acc U A;
+        for all t in post(s) do
+          if t.color != white and A not included in t.acc then
+            call dfs_red(t, A);
+          end if;
+        end for;
+      end;
+      \endverbatim */
+  ///
+  /// This algorithm is the one presented in
+  ///
+  /** \verbatim
+      @techreport{HUT-TCS-A83,
+         address = {Espoo, Finland},
+         author = {Heikki Tauriainen},
+         institution = {Helsinki University of Technology, Laboratory for
+         Theoretical Computer Science},
+         month = {December},
+         number = {A83},
+         pages = {132},
+         title = {On Translating Linear Temporal Logic into Alternating and
+         Nondeterministic Automata},
+         type = {Research Report},
+         year = {2003},
+         url = {http://www.tcs.hut.fi/Publications/info/bibdb.HUT-TCS-A83.shtml}
+      }
+      \endverbatim */
+  ///
+  SPOT_API emptiness_check_ptr
+  explicit_tau03_search(const const_twa_ptr& a, option_map o = option_map());
+
+  /// @}
+}