spot  1.99.4a
twagraph.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2014, 2015 Laboratoire de Recherche et Développement
3 // de l'Epita.
4 //
5 // This file is part of Spot, a model checking library.
6 //
7 // Spot is free software; you can redistribute it and/or modify it
8 // under the terms of the GNU General Public License as published by
9 // the Free Software Foundation; either version 3 of the License, or
10 // (at your option) any later version.
11 //
12 // Spot is distributed in the hope that it will be useful, but WITHOUT
13 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 // License for more details.
16 //
17 // You should have received a copy of the GNU General Public License
18 // along with this program. If not, see <http://www.gnu.org/licenses/>.
19 
20 #pragma once
21 
22 #include "fwd.hh"
23 #include "graph/graph.hh"
24 #include "graph/ngraph.hh"
25 #include "twa/bdddict.hh"
26 #include "twa/twa.hh"
27 #include "twaalgos/copy.hh"
28 #include "tl/formula.hh"
29 #include <sstream>
30 
31 namespace spot
32 {
33 
34  struct SPOT_API twa_graph_state: public spot::state
35  {
36  public:
37  twa_graph_state() noexcept
38  {
39  }
40 
41  virtual ~twa_graph_state() noexcept
42  {
43  }
44 
45  virtual int compare(const spot::state* other) const
46  {
47  auto o = down_cast<const twa_graph_state*>(other);
48  assert(o);
49 
50  // Do not simply return "other - this", it might not fit in an int.
51  if (o < this)
52  return -1;
53  if (o > this)
54  return 1;
55  return 0;
56  }
57 
58  virtual size_t hash() const
59  {
60  return
61  reinterpret_cast<const char*>(this) - static_cast<const char*>(nullptr);
62  }
63 
64  virtual twa_graph_state*
65  clone() const
66  {
67  return const_cast<twa_graph_state*>(this);
68  }
69 
70  virtual void destroy() const
71  {
72  }
73  };
74 
75  struct SPOT_API twa_graph_edge_data
76  {
77  bdd cond;
78  acc_cond::mark_t acc;
79 
80  explicit twa_graph_edge_data() noexcept
81  : cond(bddfalse), acc(0)
82  {
83  }
84 
85  twa_graph_edge_data(bdd cond, acc_cond::mark_t acc = 0U) noexcept
86  : cond(cond), acc(acc)
87  {
88  }
89 
90  bool operator<(const twa_graph_edge_data& other) const
91  {
92  if (cond.id() < other.cond.id())
93  return true;
94  if (cond.id() > other.cond.id())
95  return false;
96  return acc < other.acc;
97  }
98 
99  bool operator==(const twa_graph_edge_data& other) const
100  {
101  return cond.id() == other.cond.id() &&
102  acc == other.acc;
103  }
104  };
105 
106 
107  template<class Graph>
108  class SPOT_API twa_graph_succ_iterator final:
109  public twa_succ_iterator
110  {
111  private:
112  typedef typename Graph::edge edge;
113  typedef typename Graph::state_data_t state;
114  const Graph* g_;
115  edge t_;
116  edge p_;
117 
118  public:
119  twa_graph_succ_iterator(const Graph* g, edge t)
120  : g_(g), t_(t)
121  {
122  }
123 
124  virtual void recycle(edge t)
125  {
126  t_ = t;
127  }
128 
129  virtual bool first()
130  {
131  p_ = t_;
132  return p_;
133  }
134 
135  virtual bool next()
136  {
137  p_ = g_->edge_storage(p_).next_succ;
138  return p_;
139  }
140 
141  virtual bool done() const
142  {
143  return !p_;
144  }
145 
147  {
148  assert(!done());
149  return const_cast<twa_graph_state*>
150  (&g_->state_data(g_->edge_storage(p_).dst));
151  }
152 
153  virtual bdd current_condition() const
154  {
155  assert(!done());
156  return g_->edge_data(p_).cond;
157  }
158 
160  {
161  assert(!done());
162  return g_->edge_data(p_).acc;
163  }
164 
165  edge pos() const
166  {
167  return p_;
168  }
169 
170  };
171 
172  class SPOT_API twa_graph final: public twa
173  {
174  public:
177 
178  protected:
179  graph_t g_;
180  mutable unsigned init_number_;
181 
182  public:
183  twa_graph(const bdd_dict_ptr& dict)
184  : twa(dict),
185  init_number_(0)
186  {
187  }
188 
189  explicit twa_graph(const const_twa_graph_ptr& other, prop_set p)
190  : twa(other->get_dict()),
191  g_(other->g_), init_number_(other->init_number_)
192  {
193  copy_acceptance_of(other);
194  copy_ap_of(other);
195  prop_copy(other, p);
196  }
197 
198  virtual ~twa_graph()
199  {
200  get_dict()->unregister_all_my_variables(this);
201  // Prevent this state from being destroyed by ~twa(),
202  // as the state will be destroyed when g_ is destroyed.
203  last_support_conditions_input_ = nullptr;
204  }
205 
206 #ifndef SWIG
207  template <typename State_Name,
208  typename Name_Hash = std::hash<State_Name>,
209  typename Name_Equal = std::equal_to<State_Name>>
211 
212  template <typename State_Name,
213  typename Name_Hash = std::hash<State_Name>,
214  typename Name_Equal = std::equal_to<State_Name>>
216  create_namer()
217  {
219  }
220 
222  create_formula_namer()
223  {
224  return create_namer<formula>();
225  }
226 
227  void
228  release_formula_namer(namer<formula>* namer, bool keep_names);
229 #endif
230 
231  graph_t& get_graph()
232  {
233  return g_;
234  }
235 
236  const graph_t& get_graph() const
237  {
238  return g_;
239  }
240 
241  unsigned num_states() const
242  {
243  return g_.num_states();
244  }
245 
246  unsigned num_edges() const
247  {
248  return g_.num_edges();
249  }
250 
251  void set_init_state(graph_t::state s)
252  {
253  assert(s < num_states());
254  init_number_ = s;
255  }
256 
257  void set_init_state(const state* s)
258  {
259  set_init_state(state_number(s));
260  }
261 
262  graph_t::state get_init_state_number() const
263  {
264  if (num_states() == 0)
265  const_cast<graph_t&>(g_).new_state();
266  return init_number_;
267  }
268 
269  // FIXME: The return type ought to be const.
271  {
272  if (num_states() == 0)
273  const_cast<graph_t&>(g_).new_state();
274  return const_cast<twa_graph_state*>(state_from_number(init_number_));
275  }
276 
277  virtual twa_succ_iterator*
278  succ_iter(const state* st) const
279  {
280  auto s = down_cast<const typename graph_t::state_storage_t*>(st);
281  assert(s);
282  assert(!s->succ || g_.valid_trans(s->succ));
283 
284  if (this->iter_cache_)
285  {
286  auto it =
287  down_cast<twa_graph_succ_iterator<graph_t>*>(this->iter_cache_);
288  it->recycle(s->succ);
289  this->iter_cache_ = nullptr;
290  return it;
291  }
292  return new twa_graph_succ_iterator<graph_t>(&g_, s->succ);
293  }
294 
295  graph_t::state
296  state_number(const state* st) const
297  {
298  auto s = down_cast<const typename graph_t::state_storage_t*>(st);
299  assert(s);
300  return s - &g_.state_storage(0);
301  }
302 
303  const twa_graph_state*
304  state_from_number(graph_t::state n) const
305  {
306  return &g_.state_data(n);
307  }
308 
309  std::string format_state(unsigned n) const
310  {
311  std::stringstream ss;
312  ss << n;
313  return ss.str();
314  }
315 
316  virtual std::string format_state(const state* st) const
317  {
318  return format_state(state_number(st));
319  }
320 
321  twa_graph_edge_data& edge_data(const twa_succ_iterator* it)
322  {
323  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
324  return g_.edge_data(i->pos());
325  }
326 
327  twa_graph_edge_data& edge_data(unsigned t)
328  {
329  return g_.edge_data(t);
330  }
331 
332  const twa_graph_edge_data& edge_data(const twa_succ_iterator* it) const
333  {
334  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
335  return g_.edge_data(i->pos());
336  }
337 
338  const twa_graph_edge_data& edge_data(unsigned t) const
339  {
340  return g_.edge_data(t);
341  }
342 
343  edge_storage_t& edge_storage(const twa_succ_iterator* it)
344  {
345  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
346  return g_.edge_storage(i->pos());
347  }
348 
349  edge_storage_t& edge_storage(unsigned t)
350  {
351  return g_.edge_storage(t);
352  }
353 
354  const edge_storage_t
355  edge_storage(const twa_succ_iterator* it) const
356  {
357  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
358  return g_.edge_storage(i->pos());
359  }
360 
361  const edge_storage_t edge_storage(unsigned t) const
362  {
363  return g_.edge_storage(t);
364  }
365 
366  unsigned new_state()
367  {
368  return g_.new_state();
369  }
370 
371  unsigned new_states(unsigned n)
372  {
373  return g_.new_states(n);
374  }
375 
376  unsigned new_edge(unsigned src, unsigned dst,
377  bdd cond, acc_cond::mark_t acc = 0U)
378  {
379  return g_.new_edge(src, dst, cond, acc);
380  }
381 
382  unsigned new_acc_edge(unsigned src, unsigned dst,
383  bdd cond, bool acc = true)
384  {
385  if (acc)
386  return g_.new_edge(src, dst, cond, acc_.all_sets());
387  else
388  return g_.new_edge(src, dst, cond);
389  }
390 
391 #ifndef SWIG
392  auto out(unsigned src) const
393  SPOT_RETURN(g_.out(src));
394  auto out(unsigned src)
395  SPOT_RETURN(g_.out(src));
396 
397  auto states() const
398  SPOT_RETURN(g_.states());
399  auto states()
400  SPOT_RETURN(g_.states());
401 
402  auto edges() const
403  SPOT_RETURN(g_.edges());
404  auto edges()
405  SPOT_RETURN(g_.edges());
406 
407  auto edge_vector() const
408  SPOT_RETURN(g_.edge_vector());
409  auto edge_vector()
410  SPOT_RETURN(g_.edge_vector());
411 
412  auto is_dead_edge(const graph_t::edge_storage_t& t) const
413  SPOT_RETURN(g_.is_dead_edge(t));
414 #endif
415 
416  virtual bdd compute_support_conditions(const state* s) const
417  {
418  bdd sum = bddfalse;
419  for (auto& t: out(state_number(s)))
420  sum |= t.cond;
421  return sum;
422  }
423 
426  void merge_edges();
427 
429  void purge_dead_states();
430 
432  void purge_unreachable_states();
433 
434  acc_cond::mark_t state_acc_sets(unsigned s) const
435  {
436  assert(has_state_based_acc() || num_sets() == 0);
437  for (auto& t: g_.out(s))
438  // Stop at the first edge, since the remaining should be
439  // labeled identically.
440  return t.acc;
441  return 0U;
442  }
443 
444  bool state_is_accepting(unsigned s) const
445  {
446  assert(has_state_based_acc() || num_sets() == 0);
447  for (auto& t: g_.out(s))
448  // Stop at the first edge, since the remaining should be
449  // labeled identically.
450  return acc_.accepting(t.acc);
451  return false;
452  }
453 
454  bool state_is_accepting(const state* s) const
455  {
456  return state_is_accepting(state_number(s));
457  }
458 
459  bool operator==(const twa_graph& aut) const
460  {
461  if (num_states() != aut.num_states() ||
462  num_edges() != aut.num_edges() ||
463  num_sets() != aut.num_sets())
464  return false;
465  auto& trans1 = edge_vector();
466  auto& trans2 = aut.edge_vector();
467  return std::equal(trans1.begin() + 1, trans1.end(),
468  trans2.begin() + 1);
469  }
470  };
471 
472  inline twa_graph_ptr make_twa_graph(const bdd_dict_ptr& dict)
473  {
474  return std::make_shared<twa_graph>(dict);
475  }
476 
477  inline twa_graph_ptr make_twa_graph(const twa_graph_ptr& aut,
478  twa::prop_set p)
479  {
480  return std::make_shared<twa_graph>(aut, p);
481  }
482 
483  inline twa_graph_ptr make_twa_graph(const const_twa_graph_ptr& aut,
484  twa::prop_set p)
485  {
486  return std::make_shared<twa_graph>(aut, p);
487  }
488 
489  inline twa_graph_ptr make_twa_graph(const const_twa_ptr& aut,
490  twa::prop_set p)
491  {
492  auto a = std::dynamic_pointer_cast<const twa_graph>(aut);
493  if (a)
494  return std::make_shared<twa_graph>(a, p);
495  else
496  return copy(aut, p);
497  }
498 }
Definition: graph.hh:32
virtual twa_graph_state * clone() const
Duplicate a state.
Definition: twagraph.hh:65
virtual bool done() const
Check whether the iteration is finished.
Definition: twagraph.hh:141
virtual int compare(const spot::state *other) const
Compares two states (that come from the same automaton).
Definition: twagraph.hh:45
virtual twa_succ_iterator * succ_iter(const state *st) const
Get an iterator over the successors of local_state.
Definition: twagraph.hh:278
A Transition-based ω-Automaton.
Definition: twa.hh:494
LTL/PSL formula interface.
Abstract class for states.
Definition: twa.hh:42
virtual bool first()
Position the iterator on the first successor (if any).
Definition: twagraph.hh:129
Definition: graph.hh:177
virtual size_t hash() const
Hash a state.
Definition: twagraph.hh:58
virtual twa_graph_state * current_state() const
Get the state of the current successor.
Definition: twagraph.hh:146
Definition: twa.hh:885
Definition: ngraph.hh:32
virtual bdd current_condition() const
Get the condition on the transition leading to this successor.
Definition: twagraph.hh:153
Definition: graph.hh:153
virtual bool next()
Jump to the next successor (if any).
Definition: twagraph.hh:135
Iterate over the successors of a state.
Definition: twa.hh:331
virtual twa_graph_state * get_init_state() const
Get the initial state of the automaton.
Definition: twagraph.hh:270
virtual void destroy() const
Release a state.
Definition: twagraph.hh:70
Definition: twagraph.hh:108
Definition: twagraph.hh:172
Definition: twagraph.hh:34
virtual acc_cond::mark_t current_acceptance_conditions() const
Get the acceptance conditions on the transition leading to this successor.
Definition: twagraph.hh:159
Definition: acc.hh:34
Definition: twagraph.hh:75
twa_graph_ptr copy(const const_twa_ptr &aut, twa::prop_set p, bool preserve_names=false)
Build an explicit automaton from all states of aut,.

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Sun Oct 11 2015 10:50:08 for spot by doxygen 1.8.9.1