spot  1.99.7
twagraph.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2014, 2015, 2016 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 <spot/twa/fwd.hh>
23 #include <spot/graph/graph.hh>
24 #include <spot/graph/ngraph.hh>
25 #include <spot/twa/bdddict.hh>
26 #include <spot/twa/twa.hh>
27 #include <spot/twaalgos/copy.hh>
28 #include <spot/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 
146  virtual const twa_graph_state* dst() const
147  {
148  assert(!done());
149  return &g_->state_data(g_->edge_storage(p_).dst);
150  }
151 
152  virtual bdd cond() const
153  {
154  assert(!done());
155  return g_->edge_data(p_).cond;
156  }
157 
158  virtual acc_cond::mark_t acc() const
159  {
160  assert(!done());
161  return g_->edge_data(p_).acc;
162  }
163 
164  edge pos() const
165  {
166  return p_;
167  }
168 
169  };
170 
171  class SPOT_API twa_graph final: public twa
172  {
173  public:
176  // We avoid using graph_t::state because graph_t is not
177  // instantiated in the SWIG bindings, and SWIG would therefore
178  // handle graph_t::state as an abstract type.
179  typedef unsigned state_num;
180  static_assert(std::is_same<typename graph_t::state, state_num>::value,
181  "type mismatch");
182 
183  protected:
184  graph_t g_;
185  mutable unsigned init_number_;
186 
187  public:
188  twa_graph(const bdd_dict_ptr& dict)
189  : twa(dict),
190  init_number_(0)
191  {
192  }
193 
194  explicit twa_graph(const const_twa_graph_ptr& other, prop_set p)
195  : twa(other->get_dict()),
196  g_(other->g_), init_number_(other->init_number_)
197  {
198  copy_acceptance_of(other);
199  copy_ap_of(other);
200  prop_copy(other, p);
201  }
202 
203  virtual ~twa_graph()
204  {
205  // Prevent this state from being destroyed by ~twa(),
206  // as the state will be destroyed when g_ is destroyed.
207  last_support_conditions_input_ = nullptr;
208  }
209 
210 #ifndef SWIG
211  template <typename State_Name,
212  typename Name_Hash = std::hash<State_Name>,
213  typename Name_Equal = std::equal_to<State_Name>>
215 
216  template <typename State_Name,
217  typename Name_Hash = std::hash<State_Name>,
218  typename Name_Equal = std::equal_to<State_Name>>
220  create_namer()
221  {
223  }
224 
226  create_formula_namer()
227  {
228  return create_namer<formula>();
229  }
230 
231  void
232  release_formula_namer(namer<formula>* namer, bool keep_names);
233 #endif
234 
235  graph_t& get_graph()
236  {
237  return g_;
238  }
239 
240  const graph_t& get_graph() const
241  {
242  return g_;
243  }
244 
245  unsigned num_states() const
246  {
247  return g_.num_states();
248  }
249 
250  unsigned num_edges() const
251  {
252  return g_.num_edges();
253  }
254 
255  void set_init_state(state_num s)
256  {
257  assert(s < num_states());
258  init_number_ = s;
259  }
260 
261  void set_init_state(const state* s)
262  {
263  set_init_state(state_number(s));
264  }
265 
266  state_num get_init_state_number() const
267  {
268  if (num_states() == 0)
269  const_cast<graph_t&>(g_).new_state();
270  return init_number_;
271  }
272 
273  virtual const twa_graph_state* get_init_state() const
274  {
275  if (num_states() == 0)
276  const_cast<graph_t&>(g_).new_state();
277  return state_from_number(init_number_);
278  }
279 
280  virtual twa_succ_iterator*
281  succ_iter(const state* st) const
282  {
283  auto s = down_cast<const typename graph_t::state_storage_t*>(st);
284  assert(s);
285  assert(!s->succ || g_.valid_trans(s->succ));
286 
287  if (this->iter_cache_)
288  {
289  auto it =
290  down_cast<twa_graph_succ_iterator<graph_t>*>(this->iter_cache_);
291  it->recycle(s->succ);
292  this->iter_cache_ = nullptr;
293  return it;
294  }
295  return new twa_graph_succ_iterator<graph_t>(&g_, s->succ);
296  }
297 
298  state_num
299  state_number(const state* st) const
300  {
301  auto s = down_cast<const typename graph_t::state_storage_t*>(st);
302  assert(s);
303  return s - &g_.state_storage(0);
304  }
305 
306  const twa_graph_state*
307  state_from_number(state_num n) const
308  {
309  return &g_.state_data(n);
310  }
311 
312  std::string format_state(unsigned n) const
313  {
314  std::stringstream ss;
315  ss << n;
316  return ss.str();
317  }
318 
319  virtual std::string format_state(const state* st) const
320  {
321  return format_state(state_number(st));
322  }
323 
324  twa_graph_edge_data& edge_data(const twa_succ_iterator* it)
325  {
326  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
327  return g_.edge_data(i->pos());
328  }
329 
330  twa_graph_edge_data& edge_data(unsigned t)
331  {
332  return g_.edge_data(t);
333  }
334 
335  const twa_graph_edge_data& edge_data(const twa_succ_iterator* it) const
336  {
337  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
338  return g_.edge_data(i->pos());
339  }
340 
341  const twa_graph_edge_data& edge_data(unsigned t) const
342  {
343  return g_.edge_data(t);
344  }
345 
346  edge_storage_t& edge_storage(const twa_succ_iterator* it)
347  {
348  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
349  return g_.edge_storage(i->pos());
350  }
351 
352  edge_storage_t& edge_storage(unsigned t)
353  {
354  return g_.edge_storage(t);
355  }
356 
357  const edge_storage_t
358  edge_storage(const twa_succ_iterator* it) const
359  {
360  auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
361  return g_.edge_storage(i->pos());
362  }
363 
364  const edge_storage_t edge_storage(unsigned t) const
365  {
366  return g_.edge_storage(t);
367  }
368 
369  unsigned new_state()
370  {
371  return g_.new_state();
372  }
373 
374  unsigned new_states(unsigned n)
375  {
376  return g_.new_states(n);
377  }
378 
379  unsigned new_edge(unsigned src, unsigned dst,
380  bdd cond, acc_cond::mark_t acc = 0U)
381  {
382  return g_.new_edge(src, dst, cond, acc);
383  }
384 
385  unsigned new_acc_edge(unsigned src, unsigned dst,
386  bdd cond, bool acc = true)
387  {
388  if (acc)
389  return g_.new_edge(src, dst, cond, acc_.all_sets());
390  else
391  return g_.new_edge(src, dst, cond);
392  }
393 
394 #ifndef SWIG
395  internal::state_out<const graph_t>
396  out(unsigned src) const
397  {
398  return g_.out(src);
399  }
400 #endif
401 
402  internal::state_out<graph_t>
403  out(unsigned src)
404  {
405  return g_.out(src);
406  }
407 
408 #ifndef SWIG
409  auto states() const
410  SPOT_RETURN(g_.states());
411  auto states()
412  SPOT_RETURN(g_.states());
413 
414  auto edges() const
415  SPOT_RETURN(g_.edges());
416  auto edges()
417  SPOT_RETURN(g_.edges());
418 
419  auto edge_vector() const
420  SPOT_RETURN(g_.edge_vector());
421  auto edge_vector()
422  SPOT_RETURN(g_.edge_vector());
423 
424  auto is_dead_edge(const graph_t::edge_storage_t& t) const
425  SPOT_RETURN(g_.is_dead_edge(t));
426 #endif
427 
428  virtual bdd compute_support_conditions(const state* s) const
429  {
430  bdd sum = bddfalse;
431  for (auto& t: out(state_number(s)))
432  sum |= t.cond;
433  return sum;
434  }
435 
438  void merge_edges();
439 
441  void purge_dead_states();
442 
444  void purge_unreachable_states();
445 
446  acc_cond::mark_t state_acc_sets(unsigned s) const
447  {
448  assert(prop_state_acc() || num_sets() == 0);
449  for (auto& t: g_.out(s))
450  // Stop at the first edge, since the remaining should be
451  // labeled identically.
452  return t.acc;
453  return 0U;
454  }
455 
456  bool state_is_accepting(unsigned s) const
457  {
458  assert(prop_state_acc() || num_sets() == 0);
459  for (auto& t: g_.out(s))
460  // Stop at the first edge, since the remaining should be
461  // labeled identically.
462  return acc_.accepting(t.acc);
463  return false;
464  }
465 
466  bool state_is_accepting(const state* s) const
467  {
468  return state_is_accepting(state_number(s));
469  }
470 
471  bool operator==(const twa_graph& aut) const
472  {
473  if (num_states() != aut.num_states() ||
474  num_edges() != aut.num_edges() ||
475  num_sets() != aut.num_sets())
476  return false;
477  auto& trans1 = edge_vector();
478  auto& trans2 = aut.edge_vector();
479  return std::equal(trans1.begin() + 1, trans1.end(),
480  trans2.begin() + 1);
481  }
482 
483  void defrag_states(std::vector<unsigned>&& newst, unsigned used_states);
484  };
485 
486  inline twa_graph_ptr make_twa_graph(const bdd_dict_ptr& dict)
487  {
488  return std::make_shared<twa_graph>(dict);
489  }
490 
491  inline twa_graph_ptr make_twa_graph(const twa_graph_ptr& aut,
492  twa::prop_set p)
493  {
494  return std::make_shared<twa_graph>(aut, p);
495  }
496 
497  inline twa_graph_ptr make_twa_graph(const const_twa_graph_ptr& aut,
498  twa::prop_set p)
499  {
500  return std::make_shared<twa_graph>(aut, p);
501  }
502 
503  inline twa_graph_ptr make_twa_graph(const const_twa_ptr& aut,
504  twa::prop_set p)
505  {
506  auto a = std::dynamic_pointer_cast<const twa_graph>(aut);
507  if (a)
508  return std::make_shared<twa_graph>(a, p);
509  else
510  return copy(aut, p);
511  }
512 }
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:281
A Transition-based ω-Automaton.
Definition: twa.hh:483
LTL/PSL formula interface.
Abstract class for states.
Definition: twa.hh:43
virtual bool first()
Position the iterator on the first successor (if any).
Definition: twagraph.hh:129
Definition: graph.hh:183
virtual size_t hash() const
Hash a state.
Definition: twagraph.hh:58
Definition: twa.hh:901
Definition: ngraph.hh:32
virtual acc_cond::mark_t acc() const
Get the acceptance conditions on the transition leading to this successor.
Definition: twagraph.hh:158
Definition: graph.hh:158
virtual const twa_graph_state * dst() const
Get the state of the current successor.
Definition: twagraph.hh:146
virtual bool next()
Jump to the next successor (if any).
Definition: twagraph.hh:135
Iterate over the successors of a state.
Definition: twa.hh:332
virtual void destroy() const
Release a state.
Definition: twagraph.hh:70
virtual const twa_graph_state * get_init_state() const
Get the initial state of the automaton.
Definition: twagraph.hh:273
Definition: twagraph.hh:108
virtual bdd cond() const
Get the condition on the transition leading to this successor.
Definition: twagraph.hh:152
Definition: twagraph.hh:171
Definition: twagraph.hh:34
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 Fri Jan 15 2016 13:01:50 for spot by doxygen 1.8.9.1