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

20
#pragma once
21

22
#include "fwd.hh"
23
#include "graph/graph.hh"
24
#include "graph/ngraph.hh"
25
26
#include "tgba/bdddict.hh"
#include "tgba/tgba.hh"
27
#include "tgbaalgos/dupexp.hh"
28
29
30
31
32
33
34
35
#include <sstream>

namespace spot
{

  struct SPOT_API tgba_graph_state: public spot::state
  {
  public:
36
37
38
39
40
    tgba_graph_state():
      spot::state()
    {
    }

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
    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;
78
    acc_cond::mark_t acc;
79
80

    explicit tgba_graph_trans_data()
81
      : cond(bddfalse), acc(0)
82
83
84
    {
    }

85
    tgba_graph_trans_data(bdd cond, acc_cond::mark_t acc = 0U)
86
87
88
      : cond(cond), acc(acc)
    {
    }
89
90
91
92
93
94
95
96
97

    bool operator<(const tgba_graph_trans_data& other) const
    {
      if (cond.id() < other.cond.id())
	return true;
      if (cond.id() > other.cond.id())
	return false;
      return acc < other.acc;
    }
98
99
100
101
102
103

    bool operator==(const tgba_graph_trans_data& other) const
    {
      return cond.id() == other.cond.id() &&
        acc == other.acc;
    }
104
105
106
107
  };


  template<class Graph>
108
  class SPOT_API tgba_digraph_succ_iterator: public tgba_succ_iterator
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
153
154
155
156
157
  {
  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;
    }

158
    virtual acc_cond::mark_t current_acceptance_conditions() const
159
160
161
162
163
164
165
166
167
168
169
170
    {
      assert(!done());
      return g_->trans_data(p_).acc;
    }

    transition pos() const
    {
      return p_;
    }

  };

171
  class SPOT_API tgba_digraph: public tgba
172
  {
173
  public:
174
    typedef digraph<tgba_graph_state, tgba_graph_trans_data> graph_t;
175
    typedef graph_t::trans_storage_t trans_storage_t;
176
177

  protected:
178
    graph_t g_;
179
    mutable unsigned init_number_;
180
181

  public:
182
    tgba_digraph(const bdd_dict_ptr& dict)
183
      : tgba(dict),
184
	init_number_(0)
185
186
187
    {
    }

188
    explicit tgba_digraph(const const_tgba_digraph_ptr& other, prop_set p)
189
190
191
      : tgba(other->get_dict()),
        g_(other->g_), init_number_(other->init_number_)
      {
192
	copy_acceptance_of(other);
193
	copy_ap_of(other);
194
	prop_copy(other, p);
195
196
      }

197
198
    virtual ~tgba_digraph()
    {
199
      get_dict()->unregister_all_my_variables(this);
200
201
202
203
204
      // Prevent this state from being destroyed by ~tgba(),
      // as the state will be destroyed when g_ is destroyed.
      last_support_conditions_input_ = 0;
    }

205
206
    // FIXME: Once we ditch GCC 4.6, we can using a template aliases
    // (supported from GCC 4.7 onward) instead of this.
207
208
209
    template <typename State_Name,
	      typename Name_Hash = std::hash<State_Name>,
	      typename Name_Equal = std::equal_to<State_Name>>
210
211
212
213
214
215
216
217
218
    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*
219
220
221
222
223
    create_namer()
    {
      return new named_graph<graph_t, State_Name, Name_Hash, Name_Equal>(g_);
    }

224
225
226
227
228
    graph_t& get_graph()
    {
      return g_;
    }

229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
    const graph_t& get_graph() const
    {
      return g_;
    }

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

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

    void set_init_state(graph_t::state s)
    {
246
247
      assert(s < num_states());
      init_number_ = s;
248
249
250
251
    }

    void set_init_state(const state* s)
    {
252
      set_init_state(state_number(s));
253
254
    }

255
    graph_t::state get_init_state_number() const
256
257
258
    {
      if (num_states() == 0)
	const_cast<graph_t&>(g_).new_state();
259
      return init_number_;
260
261
    }

262
263
    // FIXME: The return type ought to be const.
    virtual tgba_graph_state* get_init_state() const
264
265
266
    {
      if (num_states() == 0)
	const_cast<graph_t&>(g_).new_state();
267
      return const_cast<tgba_graph_state*>(state_from_number(init_number_));
268
269
270
271
272
273
274
    }

    virtual tgba_succ_iterator*
    succ_iter(const state* st) const
    {
      auto s = down_cast<const typename graph_t::state_storage_t*>(st);
      assert(s);
275
      assert(!s->succ || g_.valid_trans(s->succ));
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295

      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);
    }

296
    const tgba_graph_state*
297
298
299
300
301
    state_from_number(graph_t::state n) const
    {
      return &g_.state_data(n);
    }

302
    std::string format_state(unsigned n) const
303
304
    {
      std::stringstream ss;
305
      ss << n;
306
307
308
      return ss.str();
    }

309
310
311
312
313
    virtual std::string format_state(const state* st) const
    {
      return format_state(state_number(st));
    }

314
315
316
317
318
319
    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());
    }

320
321
322
323
    tgba_graph_trans_data& trans_data(unsigned t)
    {
      return g_.trans_data(t);
    }
324

325
326
327
328
329
330
331
332
333
334
335
    const tgba_graph_trans_data& trans_data(const tgba_succ_iterator* it) const
    {
      auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
      return g_.trans_data(i->pos());
    }

    const tgba_graph_trans_data& trans_data(unsigned t) const
    {
      return g_.trans_data(t);
    }

336
    trans_storage_t& trans_storage(const tgba_succ_iterator* it)
337
338
339
340
341
    {
      auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
      return g_.trans_storage(i->pos());
    }

342
    trans_storage_t& trans_storage(unsigned t)
343
344
345
346
    {
      return g_.trans_storage(t);
    }

347
    const trans_storage_t
348
349
350
351
352
353
      trans_storage(const tgba_succ_iterator* it) const
    {
      auto* i = down_cast<const tgba_digraph_succ_iterator<graph_t>*>(it);
      return g_.trans_storage(i->pos());
    }

354
    const trans_storage_t trans_storage(unsigned t) const
355
356
357
358
    {
      return g_.trans_storage(t);
    }

359
360
361
362
363
364
365
366
367
368
369
    unsigned new_state()
    {
      return g_.new_state();
    }

    unsigned new_states(unsigned n)
    {
      return g_.new_states(n);
    }

    unsigned new_transition(unsigned src, unsigned dst,
370
			    bdd cond, acc_cond::mark_t acc = 0U)
371
372
373
374
    {
      return g_.new_transition(src, dst, cond, acc);
    }

375
376
377
378
    unsigned new_acc_transition(unsigned src, unsigned dst,
				bdd cond, bool acc = true)
    {
      if (acc)
379
	return g_.new_transition(src, dst, cond, acc_.all_sets());
380
381
382
383
      else
	return g_.new_transition(src, dst, cond);
    }

384
385
386
387
388
389
390
391
392
393
394
395
396
397
    auto out(unsigned src) const
      SPOT_RETURN(g_.out(src));
    auto out(unsigned src)
      SPOT_RETURN(g_.out(src));

    auto states() const
      SPOT_RETURN(g_.states());
    auto states()
      SPOT_RETURN(g_.states());

    auto transitions() const
      SPOT_RETURN(g_.transitions());
    auto transitions()
      SPOT_RETURN(g_.transitions());
398

399
400
401
402
403
    auto transition_vector() const
      SPOT_RETURN(g_.transition_vector());
    auto transition_vector()
      SPOT_RETURN(g_.transition_vector());

404
    auto is_dead_transition(const graph_t::trans_storage_t& t) const
405
406
      SPOT_RETURN(g_.is_dead_transition(t));

407
    virtual bdd compute_support_conditions(const state* s) const
408
    {
409
410
411
412
      bdd sum = bddfalse;
      for (auto& t: out(state_number(s)))
	sum |= t.cond;
      return sum;
413
    }
414
415
416

    /// Iterate over all transitions, and merge those with compatible
    /// extremities and acceptance.
417
    void merge_transitions();
418

419
420
421
    /// Remove all states without successors.
    void purge_dead_states();

422
423
424
    /// Remove all unreachable states.
    void purge_unreachable_states();

425
426
    bool state_is_accepting(unsigned s) const
    {
427
      assert(has_state_based_acc() || acc_.num_sets() == 0);
428
429
430
      for (auto& t: g_.out(s))
	// Stop at the first transition, since the remaining should be
	// labeled identically.
431
	return acc_.accepting(t.acc);
432
433
434
435
436
437
438
439
      return false;
    }

    bool state_is_accepting(const state* s) const
    {
      return state_is_accepting(state_number(s));
    }

440
441
442
443
444
445
446
447
448
449
450
    bool operator==(const tgba_digraph& aut) const
    {
      if (num_states() != aut.num_states() ||
          num_transitions() != aut.num_transitions() ||
          acc().num_sets() != aut.acc().num_sets())
        return false;
      auto& trans1 = transition_vector();
      auto& trans2 = aut.transition_vector();
      return std::equal(trans1.begin() + 1, trans1.end(),
                        trans2.begin() + 1);
    }
451
452
  };

453
  inline tgba_digraph_ptr make_tgba_digraph(const bdd_dict_ptr& dict)
454
455
456
  {
    return std::make_shared<tgba_digraph>(dict);
  }
457

458
459
  inline tgba_digraph_ptr make_tgba_digraph(const tgba_digraph_ptr& aut,
					    tgba::prop_set p)
460
  {
461
    return std::make_shared<tgba_digraph>(aut, p);
462
463
  }

464
465
  inline tgba_digraph_ptr make_tgba_digraph(const const_tgba_digraph_ptr& aut,
					    tgba::prop_set p)
466
  {
467
    return std::make_shared<tgba_digraph>(aut, p);
468
469
  }

470
471
  inline tgba_digraph_ptr make_tgba_digraph(const const_tgba_ptr& aut,
					    tgba::prop_set p)
472
  {
473
474
475
    auto a = std::dynamic_pointer_cast<const tgba_digraph>(aut);
    if (a)
      return std::make_shared<tgba_digraph>(a, p);
476
    else
477
      return tgba_dupexp_dfs(aut, p);
478
  }
479
}