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

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Wed Aug 26 2015 08:42:37 for spot by doxygen 1.8.8