* src/tgbaalgos/se05.hh, src/tgbaalgos/tau03.hh: Typo.

* src/tgbaalgos/tau03.cc: Suppress optimisations, the algorithm is now
the original one.
* src/tgbaalgos/tau03opt.hh, src/tgbaalgos/tau03opt.cc: New files
implementing most of all the optimisations of tau03.
* src/tgbaalgos/Makefile.am: Add them.
* src/tgbatest/ltl2tgba.cc, src/tgbatest/randtgba.cc: Make them public.
* src/tgbatest/tba_samples_from_spin.test: Test them.

src/tgbaalgos/tau03opt.hh

@@ -0,0 +1,91 @@
+// Copyright (C) 2003, 2004  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 2 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 Spot; see the file COPYING.  If not, write to the Free
+// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
+// 02111-1307, USA.
+
+#ifndef SPOT_TGBAALGOS_TAU03_OPT_HH
+# define SPOT_TGBAALGOS_TAU03_OPT_HH
+
+namespace spot
+{
+  class tgba;
+  class emptiness_check;
+
+  /// \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 accepting 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 = cyan;
+  ///   s.acc = emptyset;
+  ///   for all t in post(s) do
+  ///     let (s, l, a, t) be the edge from s to t;
+  ///     if t.color == white then
+  ///       call dfs_blue(t);
+  ///     else if t.color == cyan && s.acc U a U t.acc == all_acc then
+  ///       report a cycle;
+  ///     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;
+  ///   s.color = blue;
+  /// end;
+  ///
+  /// procedure dfs_red(s, A)
+  /// begin
+  ///   s.acc = s.acc U A;
+  ///   for all t in post(s) do
+  ///     let (s, l, a, t) be the edge from s to t;
+  ///     if t.color != white then
+  ///       if t.color == cyan && A U t.acc == all_acc then
+  ///         report a cycle;
+  ///       else if A not included in t.acc then
+  ///         call dfs_red(t, A);
+  ///       end if;
+  ///     end if;
+  ///   end for;
+  /// end;
+  /// \endverbatim
+  ///
+  /// This algorithm is an optimisation of the one implemented in
+  /// spot::explicit_tau03_search.
+  ///
+  emptiness_check* explicit_tau03_opt_search(const tgba *a);
+
+  /// @}
+}
+
+#endif // SPOT_TGBAALGOS_TAU03_OPT_HH