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/product.cc
+++ b/src/twaalgos/product.cc
@ -0,0 +1,113 @@
+// -*- coding: utf-8 -*-
+// Copyright (C) 2014, 2015 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 "product.hh"
+#include "twa/twagraph.hh"
+#include <deque>
+#include <unordered_map>
+#include "misc/hash.hh"
+
+namespace spot
+{
+  namespace
+  {
+    typedef std::pair<unsigned, unsigned> product_state;
+
+    struct product_state_hash
+    {
+      size_t
+      operator()(product_state s) const
+      {
+        return wang32_hash(s.first ^ wang32_hash(s.second));
+      }
+    };
+  }
+
+
+  twa_graph_ptr product(const const_twa_graph_ptr& left,
+			   const const_twa_graph_ptr& right,
+			   unsigned left_state,
+			   unsigned right_state)
+  {
+    std::unordered_map<product_state, unsigned, product_state_hash> s2n;
+    std::deque<std::pair<product_state, unsigned>> todo;
+
+    assert(left->get_dict() == right->get_dict());
+    auto res = make_twa_graph(left->get_dict());
+    res->copy_ap_of(left);
+    res->copy_ap_of(right);
+    auto left_num = left->acc().num_sets();
+    auto right_acc = right->get_acceptance();
+    right_acc.shift_left(left_num);
+    right_acc.append_and(left->get_acceptance());
+    res->set_acceptance(left_num + right->acc().num_sets(), right_acc);
+
+    auto v = new product_states;
+    res->set_named_prop("product-states", v);
+
+    auto new_state =
+      [&](unsigned left_state, unsigned right_state) -> unsigned
+      {
+	product_state x(left_state, right_state);
+	auto p = s2n.emplace(x, 0);
+	if (p.second)		// This is a new state
+	  {
+	    p.first->second = res->new_state();
+	    todo.emplace_back(x, p.first->second);
+	    assert(p.first->second == v->size());
+	    v->push_back(x);
+	  }
+	return p.first->second;
+      };
+
+    res->set_init_state(new_state(left_state, right_state));
+    if (right_acc.is_false())
+      // Do not bother doing any work if the resulting acceptance is
+      // false.
+      return res;
+    while (!todo.empty())
+      {
+	auto top = todo.front();
+	todo.pop_front();
+	for (auto& l: left->out(top.first.first))
+	  for (auto& r: right->out(top.first.second))
+	    {
+	      auto cond = l.cond & r.cond;
+	      if (cond == bddfalse)
+		continue;
+	      auto dst = new_state(l.dst, r.dst);
+	      res->new_transition(top.second, dst, cond,
+				  res->acc().join(left->acc(), l.acc,
+						  right->acc(), r.acc));
+	      // If right is deterministic, we can abort immediately!
+	    }
+      }
+
+    return res;
+  }
+
+  twa_graph_ptr product(const const_twa_graph_ptr& left,
+			   const const_twa_graph_ptr& right)
+  {
+    return product(left, right,
+		   left->get_init_state_number(),
+		   right->get_init_state_number());
+  }
+
+}