tgbagraph.hh 8.29 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
// -*- coding: utf-8 -*-
// Copyright (C) 2014 Laboratoire de Recherche et Développement de
// l'Epita.
//
// 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/>.

#ifndef SPOT_TGBA_TGBAGRAPH_HH
# define SPOT_TGBA_TGBAGRAPH_HH

#include "graph/graph.hh"
24
#include "graph/ngraph.hh"
25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152
#include "tgba/bdddict.hh"
#include "tgba/tgba.hh"
#include "misc/bddop.hh"
#include <sstream>

namespace spot
{

  struct SPOT_API tgba_graph_state: public spot::state
  {
  public:
    virtual ~tgba_graph_state() noexcept
    {
    }

    virtual int compare(const spot::state* other) const
    {
      auto o = down_cast<const tgba_graph_state*>(other);
      assert(o);

      // Do not simply return "other - this", it might not fit in an int.
      if (o < this)
	return -1;
      if (o > this)
	return 1;
      return 0;
    }

    virtual size_t hash() const
    {
      return
	reinterpret_cast<const char*>(this) - static_cast<const char*>(nullptr);
    }

    virtual tgba_graph_state*
    clone() const
    {
      return const_cast<tgba_graph_state*>(this);
    }

    virtual void destroy() const
    {
    }
  };

  struct SPOT_API tgba_graph_trans_data
  {
    bdd cond;
    bdd acc;

    explicit tgba_graph_trans_data()
      : cond(bddfalse), acc(bddfalse)
    {
    }

    tgba_graph_trans_data(bdd cond, bdd acc)
      : cond(cond), acc(acc)
    {
    }
  };


  template<class Graph>
  class tgba_digraph_succ_iterator: public tgba_succ_iterator
  {
  private:
    typedef typename Graph::transition transition;
    typedef typename Graph::state_data_t state;
    const Graph* g_;
    transition t_;
    transition p_;

  public:
    tgba_digraph_succ_iterator(const Graph* g, transition t)
      : g_(g), t_(t)
    {
    }

    virtual void recycle(transition t)
    {
      t_ = t;
    }

    virtual bool first()
    {
      p_ = t_;
      return p_;
    }

    virtual bool next()
    {
      p_ = g_->trans_storage(p_).next_succ;
      return p_;
    }

    virtual bool done() const
    {
      return !p_;
    }

    virtual tgba_graph_state* current_state() const
    {
      assert(!done());
      return const_cast<tgba_graph_state*>
	(&g_->state_data(g_->trans_storage(p_).dst));
    }

    virtual bdd current_condition() const
    {
      assert(!done());
      return g_->trans_data(p_).cond;
    }

    virtual bdd current_acceptance_conditions() const
    {
      assert(!done());
      return g_->trans_data(p_).acc;
    }

    transition pos() const
    {
      return p_;
    }

  };

  class tgba_digraph: public tgba
  {
153
  public:
154
    typedef digraph<tgba_graph_state, tgba_graph_trans_data> graph_t;
155 156

  protected:
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176
    graph_t g_;
    bdd_dict* dict_;
    bdd all_acceptance_conditions_;
    bdd neg_acceptance_conditions_;
    mutable const tgba_graph_state* init_;

  public:
    tgba_digraph(bdd_dict* dict)
      : dict_(dict), init_(nullptr)
    {
    }

    virtual ~tgba_digraph()
    {
      dict_->unregister_all_my_variables(this);
      // Prevent this state from being destroyed by ~tgba(),
      // as the state will be destroyed when g_ is destroyed.
      last_support_conditions_input_ = 0;
    }

177 178
    // FIXME: Once we ditch GCC 4.6, we can using a template aliases
    // (supported from GCC 4.7 onward) instead of this.
179 180 181
    template <typename State_Name,
	      typename Name_Hash = std::hash<State_Name>,
	      typename Name_Equal = std::equal_to<State_Name>>
182 183 184 185 186 187 188 189 190
    struct namer
    {
      typedef named_graph<graph_t, State_Name, Name_Hash, Name_Equal> type;
    };

    template <typename State_Name,
	      typename Name_Hash = std::hash<State_Name>,
	      typename Name_Equal = std::equal_to<State_Name>>
    typename namer<State_Name, Name_Hash, Name_Equal>::type*
191 192 193 194 195
    create_namer()
    {
      return new named_graph<graph_t, State_Name, Name_Hash, Name_Equal>(g_);
    }

196 197 198 199 200
    graph_t& get_graph()
    {
      return g_;
    }

201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255
    const graph_t& get_graph() const
    {
      return g_;
    }

    virtual bdd_dict* get_dict() const
    {
      return this->dict_;
    }

    unsigned num_states() const
    {
      return g_.num_states();
    }

    unsigned num_transitions() const
    {
      return g_.num_transitions();
    }


    void set_init_state(graph_t::state s)
    {
      init_ = &g_.state_data(s);
    }

    void set_init_state(const state* s)
    {
      init_ = down_cast<const tgba_graph_state*>(s);
      assert(init_);
    }

    virtual tgba_graph_state* get_init_state() const
    {
      if (num_states() == 0)
	const_cast<graph_t&>(g_).new_state();
      if (!init_)
	init_ = &g_.state_data(0);
      return const_cast<tgba_graph_state*>(init_);
    }

    virtual graph_t::state get_init_state_number() const
    {
      if (num_states() == 0)
	const_cast<graph_t&>(g_).new_state();
      if (!init_)
	return 0;
      return state_number(init_);
    }

    virtual tgba_succ_iterator*
    succ_iter(const state* st) const
    {
      auto s = down_cast<const typename graph_t::state_storage_t*>(st);
      assert(s);
256
      assert(!s->succ || g_.valid_trans(s->succ));
257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330

      if (this->iter_cache_)
	{
	  auto it =
	    down_cast<tgba_digraph_succ_iterator<graph_t>*>(this->iter_cache_);
	  it->recycle(s->succ);
	  this->iter_cache_ = nullptr;
	  return it;
	}
      return new tgba_digraph_succ_iterator<graph_t>(&g_, s->succ);
    }

    graph_t::state
    state_number(const state* st) const
    {
      auto s = down_cast<const typename graph_t::state_storage_t*>(st);
      assert(s);
      return s - &g_.state_storage(0);
    }

    const state*
    state_from_number(graph_t::state n) const
    {
      return &g_.state_data(n);
    }

    virtual std::string format_state(const state* st) const
    {
      std::stringstream ss;
      ss << state_number(st);
      return ss.str();
    }

    tgba_graph_trans_data& trans_data(const tgba_succ_iterator* it)
    {
      auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
      return g_.trans_data(i->pos());
    }


    void set_acceptance_conditions(bdd all)
    {
      bdd sup = bdd_support(all);
      this->dict_->register_acceptance_variables(sup, this);
      neg_acceptance_conditions_ = bddtrue;
      while (sup != bddtrue)
	{
	  neg_acceptance_conditions_ &= bdd_nithvar(bdd_var(sup));
	  sup = bdd_high(sup);
	}
      all_acceptance_conditions_ =
	compute_all_acceptance_conditions(neg_acceptance_conditions_);
    }

    /// \brief Copy the acceptance conditions of another tgba.
    void copy_acceptance_conditions_of(const tgba *a)
    {
      set_acceptance_conditions(a->neg_acceptance_conditions());
    }

    virtual bdd all_acceptance_conditions() const
    {
      return all_acceptance_conditions_;
    }

    virtual bdd neg_acceptance_conditions() const
    {
      return neg_acceptance_conditions_;
    }

    virtual bdd compute_support_conditions(const state*) const
    {
      return bddtrue;
    }
331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371

    /// Iterate over all transitions, and merge those with compatible
    /// extremities and acceptance.
    void merge_transitions()
    {
      for (auto& s: g_.states())
	{
	  // Map a pair (dest state, acc) to the first transition seen
	  // with such characteristic.

	  typedef std::pair<graph_t::state, int> key_t;
	  std::unordered_map<key_t, graph_t::transition, pair_hash> trmap;

	  auto t = g_.out_iteraser(s);
	  while (t)
	    {
	      // Simply skip false transitions.
	      if (t->cond == bddfalse)
		{
		  t.erase();
		  continue;
		}

	      key_t k(t->dst, t->acc.id());
	      auto p = trmap.insert(make_pair(k, t.trans()));
	      if (!p.second)
		{
		  // A previous transitions exist for k, merge the
		  // condition, and schedule the transition for
		  // removal.
		  g_.trans_data(p.first->second).cond |= t->cond;
		  t.erase();
		}
	      else
		{
		  ++t;
		}
	    }
	}
      g_.defrag();
    }
372 373 374 375 376
  };

}

#endif // SPOT_TGBA_TGBAGRAPH_HH