spot  2.0.3
 All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Modules Pages
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 override
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 override
59  {
60  return
61  reinterpret_cast<const char*>(this) - static_cast<const char*>(nullptr);
62  }
63 
64  virtual twa_graph_state*
65  clone() const override
66  {
67  return const_cast<twa_graph_state*>(this);
68  }
69 
70  virtual void destroy() const override
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  void recycle(edge t)
125  {
126  t_ = t;
127  }
128 
129  virtual bool first() override
130  {
131  p_ = t_;
132  return p_;
133  }
134 
135  virtual bool next() override
136  {
137  p_ = g_->edge_storage(p_).next_succ;
138  return p_;
139  }
140 
141  virtual bool done() const override
142  {
143  return !p_;
144  }
145 
146  virtual const twa_graph_state* dst() const override
147  {
148  assert(!done());
149  return &g_->state_data(g_->edge_storage(p_).dst);
150  }
151 
152  virtual bdd cond() const override
153  {
154  assert(!done());
155  return g_->edge_data(p_).cond;
156  }
157 
158  virtual acc_cond::mark_t acc() const override
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  }
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>>
216  namer<State_Name, Name_Hash, Name_Equal>*
217  create_namer()
218  {
220  }
221 
222  namer<formula>*
223  create_formula_namer()
224  {
225  return create_namer<formula>();
226  }
227 
228  void
229  release_formula_namer(namer<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(state_num 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  state_num 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  virtual const twa_graph_state* get_init_state() const override
271  {
272  if (num_states() == 0)
273  const_cast<graph_t&>(g_).new_state();
274  return state_from_number(init_number_);
275  }
276 
277  virtual twa_succ_iterator*
278  succ_iter(const state* st) const override
279  {
280  auto s = down_cast<const typename graph_t::state_storage_t*>(st);
281  assert(s);
282  assert(!s->succ || g_.is_valid_edge(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  state_num
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(state_num 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 override
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, this->acc().all_sets());
387  else
388  return g_.new_edge(src, dst, cond);
389  }
390 
391 #ifndef SWIG
393  out(unsigned src) const
394  {
395  return g_.out(src);
396  }
397 #endif
398 
400  out(unsigned src)
401  {
402  return g_.out(src);
403  }
404 
405 #ifndef SWIG
406  auto states() const
407  SPOT_RETURN(g_.states());
408  auto states()
409  SPOT_RETURN(g_.states());
410 
412  edges() const
413  {
414  return g_.edges();
415  }
416 #endif
417 
419  edges()
420  {
421  return g_.edges();
422  }
423 
424 #ifndef SWIG
425  auto edge_vector() const
426  SPOT_RETURN(g_.edge_vector());
427  auto edge_vector()
428  SPOT_RETURN(g_.edge_vector());
429 
430  auto is_dead_edge(const graph_t::edge_storage_t& t) const
431  SPOT_RETURN(g_.is_dead_edge(t));
432 #endif
433 
436  void merge_edges();
437 
439  void purge_dead_states();
440 
442  void purge_unreachable_states();
443 
448  void remove_unused_ap();
449 
450  acc_cond::mark_t state_acc_sets(unsigned s) const
451  {
452  assert((bool)prop_state_acc() || num_sets() == 0);
453  for (auto& t: g_.out(s))
454  // Stop at the first edge, since the remaining should be
455  // labeled identically.
456  return t.acc;
457  return 0U;
458  }
459 
460  bool state_is_accepting(unsigned s) const
461  {
462  assert((bool)prop_state_acc() || num_sets() == 0);
463  for (auto& t: g_.out(s))
464  // Stop at the first edge, since the remaining should be
465  // labeled identically.
466  return acc().accepting(t.acc);
467  return false;
468  }
469 
470  bool state_is_accepting(const state* s) const
471  {
472  return state_is_accepting(state_number(s));
473  }
474 
475  bool operator==(const twa_graph& aut) const
476  {
477  if (num_states() != aut.num_states() ||
478  num_edges() != aut.num_edges() ||
479  num_sets() != aut.num_sets())
480  return false;
481  auto& trans1 = edge_vector();
482  auto& trans2 = aut.edge_vector();
483  return std::equal(trans1.begin() + 1, trans1.end(),
484  trans2.begin() + 1);
485  }
486 
487  void defrag_states(std::vector<unsigned>&& newst, unsigned used_states);
488  };
489 
490  inline twa_graph_ptr make_twa_graph(const bdd_dict_ptr& dict)
491  {
492  return std::make_shared<twa_graph>(dict);
493  }
494 
495  inline twa_graph_ptr make_twa_graph(const twa_graph_ptr& aut,
496  twa::prop_set p)
497  {
498  return std::make_shared<twa_graph>(aut, p);
499  }
500 
501  inline twa_graph_ptr make_twa_graph(const const_twa_graph_ptr& aut,
502  twa::prop_set p)
503  {
504  return std::make_shared<twa_graph>(aut, p);
505  }
506 
507  inline twa_graph_ptr make_twa_graph(const const_twa_ptr& aut,
508  twa::prop_set p)
509  {
510  auto a = std::dynamic_pointer_cast<const twa_graph>(aut);
511  if (a)
512  return std::make_shared<twa_graph>(a, p);
513  else
514  return copy(aut, p);
515  }
516 }
Definition: graph.hh:32
unsigned num_edges() const
The number of edges in the automaton.
Definition: graph.hh:639
edge_storage_t & edge_storage(edge s)
return a reference to the storage of an edge
Definition: graph.hh:719
virtual void destroy() const override
Release a state.
Definition: twagraph.hh:70
edge_storage_t::data_t & edge_data(edge s)
return the Edgeg_Data of an edge.
Definition: graph.hh:739
state new_state(Args &&...args)
Create a new states.
Definition: graph.hh:650
unsigned num_states() const
The number of states in the automaton.
Definition: graph.hh:631
A Transition-based ω-Automaton.
Definition: twa.hh:577
LTL/PSL formula interface.
internal::state_out< digraph > out(state src)
Return a fake container with all edges leaving src.
Definition: graph.hh:794
Abstract class for states.
Definition: twa.hh:43
virtual size_t hash() const override
Hash a state.
Definition: twagraph.hh:58
Definition: graph.hh:183
const state_vector & states() const
Return the vector of states.
Definition: graph.hh:838
Definition: ngraph.hh:32
bool is_dead_edge(unsigned t) const
Tests whether an edge has been erased.
Definition: graph.hh:901
Definition: graph.hh:158
twa_graph_ptr copy(const const_twa_ptr &aut, twa::prop_set p, bool preserve_names=false, unsigned max_states=-1U)
Build an explicit automaton from all states of aut,.
virtual bool first() override
Position the iterator on the first successor (if any).
Definition: twagraph.hh:129
Iterate over the successors of a state.
Definition: twa.hh:390
Definition: graph.hh:528
virtual bdd cond() const override
Get the condition on the edge leading to this successor.
Definition: twagraph.hh:152
const edge_vector_t & edge_vector() const
Return the vector of all edges.
Definition: graph.hh:872
virtual bool done() const override
Check whether the iteration is finished.
Definition: twagraph.hh:141
virtual int compare(const spot::state *other) const override
Compares two states (that come from the same automaton).
Definition: twagraph.hh:45
virtual const twa_graph_state * dst() const override
Get the destination state of the current edge.
Definition: twagraph.hh:146
A structure for selecting a set of automaton properties to copy.
Definition: twa.hh:1248
unsigned num_sets() const
Number of acceptance sets used by the automaton.
Definition: twa.hh:841
state new_states(unsigned n, Args &&...args)
Create n new states.
Definition: graph.hh:664
virtual acc_cond::mark_t acc() const override
Get the acceptance mark of the edge leading to this successor.
Definition: twagraph.hh:158
internal::all_trans< const digraph > edges() const
Return a fake container with all edges (exluding erased edges)
Definition: graph.hh:853
bool is_valid_edge(edge t) const
Test whether the given edge is valid.
Definition: graph.hh:889
edge new_edge(state src, out_state dst, Args &&...args)
Create a new edge.
Definition: graph.hh:760
Definition: twagraph.hh:108
A directed graph.
Definition: graph.hh:35
state_storage_t & state_storage(state s)
return a reference to the storage of a state
Definition: graph.hh:679
Definition: graph.hh:401
Definition: twagraph.hh:171
Definition: twagraph.hh:34
virtual bool next() override
Jump to the next successor (if any).
Definition: twagraph.hh:135
Definition: acc.hh:34
state_storage_t::data_t & state_data(state s)
return the State_Data associated to a state
Definition: graph.hh:699
Definition: twagraph.hh:75
virtual twa_graph_state * clone() const override
Duplicate a state.
Definition: twagraph.hh:65

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Mon Jul 11 2016 09:54:34 for spot by doxygen 1.8.8