spot  2.3.3.dev
twa.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2009, 2011, 2013-2017 Laboratoire de Recherche et
3 // Développement de l'Epita (LRDE).
4 // Copyright (C) 2003-2005 Laboratoire d'Informatique de Paris 6
5 // (LIP6), département Systèmes Répartis Coopératifs (SRC), Université
6 // Pierre et Marie Curie.
7 //
8 // This file is part of Spot, a model checking library.
9 //
10 // Spot is free software; you can redistribute it and/or modify it
11 // under the terms of the GNU General Public License as published by
12 // the Free Software Foundation; either version 3 of the License, or
13 // (at your option) any later version.
14 //
15 // Spot is distributed in the hope that it will be useful, but WITHOUT
16 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
18 // License for more details.
19 //
20 // You should have received a copy of the GNU General Public License
21 // along with this program. If not, see <http://www.gnu.org/licenses/>.
22 
23 #pragma once
24 
25 #include <cstddef>
26 #include <spot/twa/fwd.hh>
27 #include <spot/twa/acc.hh>
28 #include <spot/twa/bdddict.hh>
29 #include <cassert>
30 #include <memory>
31 #include <unordered_map>
32 #include <functional>
33 #include <array>
34 #include <vector>
35 #include <spot/misc/casts.hh>
36 #include <spot/misc/hash.hh>
37 #include <spot/tl/formula.hh>
38 #include <spot/misc/trival.hh>
39 
40 namespace spot
41 {
42  struct twa_run;
43  typedef std::shared_ptr<twa_run> twa_run_ptr;
44 
45  struct twa_word;
46  typedef std::shared_ptr<twa_word> twa_word_ptr;
47 
50  class SPOT_API state
51  {
52  public:
63  virtual int compare(const state* other) const = 0;
64 
84  virtual size_t hash() const = 0;
85 
87  virtual state* clone() const = 0;
88 
98  virtual void destroy() const
99  {
100  delete this;
101  }
102 
103  protected:
110  virtual ~state()
111  {
112  }
113  };
114 
128  {
129  bool
130  operator()(const state* left, const state* right) const
131  {
132  SPOT_ASSERT(left);
133  return left->compare(right) < 0;
134  }
135  };
136 
151  {
152  bool
153  operator()(const state* left, const state* right) const
154  {
155  SPOT_ASSERT(left);
156  return 0 == left->compare(right);
157  }
158  };
159 
175  {
176  size_t
177  operator()(const state* that) const
178  {
179  SPOT_ASSERT(that);
180  return that->hash();
181  }
182  };
183 
189  typedef std::unordered_set<const state*,
191 
195  template<class val>
196  using state_map = std::unordered_map<const state*, val,
198 
201  class SPOT_API state_unicity_table
202  {
203  state_set m;
204  public:
205 
214  const state* operator()(const state* s)
215  {
216  auto p = m.insert(s);
217  if (!p.second)
218  s->destroy();
219  return *p.first;
220  }
221 
226  const state* is_new(const state* s)
227  {
228  auto p = m.insert(s);
229  if (!p.second)
230  {
231  s->destroy();
232  return nullptr;
233  }
234  return *p.first;
235  }
236 
238  {
239  for (state_set::iterator i = m.begin(); i != m.end();)
240  {
241  // Advance the iterator before destroying its key. This
242  // avoid issues with old g++ implementations.
243  state_set::iterator old = i++;
244  (*old)->destroy();
245  }
246  }
247 
248  size_t
249  size()
250  {
251  return m.size();
252  }
253  };
254 
255 
256 
257  // Functions related to shared_ptr.
259 
260  typedef std::shared_ptr<const state> shared_state;
261 
262  inline void shared_state_deleter(state* s) { s->destroy(); }
263 
278  {
279  bool
280  operator()(shared_state left,
281  shared_state right) const
282  {
283  SPOT_ASSERT(left);
284  return left->compare(right.get()) < 0;
285  }
286  };
287 
306  {
307  bool
308  operator()(shared_state left,
309  shared_state right) const
310  {
311  SPOT_ASSERT(left);
312  return 0 == left->compare(right.get());
313  }
314  };
315 
335  {
336  size_t
337  operator()(shared_state that) const
338  {
339  SPOT_ASSERT(that);
340  return that->hash();
341  }
342  };
343 
345  typedef std::unordered_set<shared_state,
348 
397  class SPOT_API twa_succ_iterator
398  {
399  public:
400  virtual
402  {
403  }
404 
407 
422  virtual bool first() = 0;
423 
434  virtual bool next() = 0;
435 
451  virtual bool done() const = 0;
452 
454 
457 
467  virtual const state* dst() const = 0;
471  virtual bdd cond() const = 0;
474  virtual acc_cond::mark_t acc() const = 0;
475 
477  };
478 
479  namespace internal
480  {
486  struct SPOT_API succ_iterator
487  {
488  protected:
489  twa_succ_iterator* it_;
490  public:
491 
493  it_(it)
494  {
495  }
496 
497  bool operator==(succ_iterator o) const
498  {
499  return it_ == o.it_;
500  }
501 
502  bool operator!=(succ_iterator o) const
503  {
504  return it_ != o.it_;
505  }
506 
507  const twa_succ_iterator* operator*() const
508  {
509  return it_;
510  }
511 
512  void operator++()
513  {
514  if (!it_->next())
515  it_ = nullptr;
516  }
517  };
518 
519 #ifndef SWIG
520  class twa_succ_iterable
526  {
527  protected:
528  const twa* aut_;
529  twa_succ_iterator* it_;
530  public:
531  twa_succ_iterable(const twa* aut, twa_succ_iterator* it)
532  : aut_(aut), it_(it)
533  {
534  }
535 
536  twa_succ_iterable(twa_succ_iterable&& other) noexcept
537  : aut_(other.aut_), it_(other.it_)
538  {
539  other.it_ = nullptr;
540  }
541 
542  ~twa_succ_iterable(); // Defined in this file after twa
543 
545  {
546  return it_->first() ? it_ : nullptr;
547  }
548 
550  {
551  return nullptr;
552  }
553  };
554 #endif // SWIG
555  }
556 
566 
569 
622  class SPOT_API twa: public std::enable_shared_from_this<twa>
623  {
624  protected:
625  twa(const bdd_dict_ptr& d);
629  bdd_dict_ptr dict_;
630  public:
631 
632  virtual ~twa();
633 
639  virtual const state* get_init_state() const = 0;
640 
648  virtual twa_succ_iterator*
649  succ_iter(const state* local_state) const = 0;
650 
651 #ifndef SWIG
676  succ(const state* s) const
677  {
678  return {this, succ_iter(s)};
679  }
680  #endif
681 
687  {
688  if (iter_cache_)
689  delete i;
690  else
691  iter_cache_ = i;
692  }
693 
710  bdd_dict_ptr get_dict() const
711  {
712  return dict_;
713  }
714 
728  {
729  int res = dict_->has_registered_proposition(ap, this);
730  if (res < 0)
731  {
732  aps_.emplace_back(ap);
733  res = dict_->register_proposition(ap, this);
734  bddaps_ &= bdd_ithvar(res);
735  }
736  return res;
737  }
738 
739  int register_ap(std::string ap)
740  {
741  return register_ap(formula::ap(ap));
742  }
744 
748  void unregister_ap(int num);
749 
762  {
763  if (!aps_.empty())
764  throw std::runtime_error("register_ap_from_dict() may not be"
765  " called on an automaton that has already"
766  " registered some AP");
767  auto& m = get_dict()->bdd_map;
768  unsigned s = m.size();
769  for (unsigned n = 0; n < s; ++n)
770  if (m[n].refs.find(this) != m[n].refs.end())
771  {
772  aps_.emplace_back(m[n].f);
773  bddaps_ &= bdd_ithvar(n);
774  }
775  }
776 
779  const std::vector<formula>& ap() const
780  {
781  return aps_;
782  }
783 
785  bdd ap_vars() const
786  {
787  return bddaps_;
788  }
789 
796  virtual std::string format_state(const state* s) const = 0;
797 
811  virtual state* project_state(const state* s,
812  const const_twa_ptr& t) const;
813 
816  const acc_cond& acc() const
817  {
818  return acc_;
819  }
820 
822  {
823  return acc_;
824  }
826 
831  virtual bool is_empty() const;
832 
845  virtual twa_run_ptr accepting_run() const;
846 
856  virtual twa_word_ptr accepting_word() const;
857 
860  virtual bool intersects(const_twa_ptr other) const;
861 
879  virtual twa_run_ptr intersecting_run(const_twa_ptr other,
880  bool from_other = false) const;
881 
882 
889  virtual twa_word_ptr intersecting_word(const_twa_ptr other) const;
890 
891  private:
892  acc_cond acc_;
893 
894  void set_num_sets_(unsigned num)
895  {
896  if (num < acc_.num_sets())
897  {
898  acc_.~acc_cond();
899  new (&acc_) acc_cond;
900  }
901  acc_.add_sets(num - acc_.num_sets());
902  }
903 
904  public:
906  unsigned num_sets() const
907  {
908  return acc_.num_sets();
909  }
910 
913  {
914  return acc_.get_acceptance();
915  }
916 
921  void set_acceptance(unsigned num, const acc_cond::acc_code& c)
922  {
923  set_num_sets_(num);
924  acc_.set_acceptance(c);
925  }
926 
928  void copy_acceptance_of(const const_twa_ptr& a)
929  {
930  acc_ = a->acc();
931  }
932 
934  void copy_ap_of(const const_twa_ptr& a)
935  {
936  for (auto f: a->ap())
937  this->register_ap(f);
938  }
939 
952  void set_generalized_buchi(unsigned num)
953  {
954  set_num_sets_(num);
955  acc_.set_generalized_buchi();
956  }
957 
974  {
975  set_generalized_buchi(1);
976  return acc_.mark(0);
977  }
978 
979  private:
980  std::vector<formula> aps_;
981  bdd bddaps_;
982 
984  struct bprop
985  {
986  trival::repr_t state_based_acc:2; // State-based acceptance.
987  trival::repr_t inherently_weak:2; // Inherently Weak automaton.
988  trival::repr_t weak:2; // Weak automaton.
989  trival::repr_t terminal:2; // Terminal automaton.
990  trival::repr_t universal:2; // Universal automaton.
991  trival::repr_t unambiguous:2; // Unambiguous automaton.
992  trival::repr_t stutter_invariant:2; // Stutter invariant language.
993  trival::repr_t very_weak:2; // very-weak, or 1-weak
994  trival::repr_t semi_deterministic:2; // semi-deterministic automaton.
995  trival::repr_t complete:2; // Complete automaton.
996  };
997  union
998  {
999  unsigned props;
1000  bprop is;
1001  };
1002 
1003 #ifndef SWIG
1004  // Dynamic properties, are given with a name and a destructor function.
1005  std::unordered_map<std::string,
1006  std::pair<void*,
1007  std::function<void(void*)>>> named_prop_;
1008 #endif
1009  void* get_named_prop_(std::string s) const;
1010 
1011  public:
1012 
1013 #ifndef SWIG
1014  void set_named_prop(std::string s,
1030  void* val, std::function<void(void*)> destructor);
1031 
1047  template<typename T>
1048  void set_named_prop(std::string s, T* val)
1049  {
1050  set_named_prop(s, val, [](void *p) { delete static_cast<T*>(p); });
1051  }
1052 
1063  void set_named_prop(std::string s, std::nullptr_t);
1064 
1080  template<typename T>
1081  T* get_named_prop(std::string s) const
1082  {
1083  if (void* p = get_named_prop_(s))
1084  return static_cast<T*>(p);
1085  else
1086  return nullptr;
1087  }
1088 
1101  template<typename T>
1102  T* get_or_set_named_prop(std::string s)
1103  {
1104  if (void* p = get_named_prop_(s))
1105  return static_cast<T*>(p);
1106 
1107  auto tmp = new T;
1108  set_named_prop(s, tmp);
1109  return tmp;
1110  }
1111 
1112 #endif
1113 
1119  {
1120  // Destroy all named properties.
1121  for (auto& np: named_prop_)
1122  np.second.second(np.second.first);
1123  named_prop_.clear();
1124  }
1125 
1133  {
1134  if (num_sets() == 0)
1135  return true;
1136  return is.state_based_acc;
1137  }
1138 
1144  {
1145  is.state_based_acc = val.val();
1146  }
1147 
1152  trival is_sba() const
1153  {
1154  return prop_state_acc() && acc().is_buchi();
1155  }
1156 
1166  {
1167  return is.inherently_weak;
1168  }
1169 
1178  {
1179  is.inherently_weak = val.val();
1180  if (!val)
1181  is.very_weak = is.terminal = is.weak = val.val();
1182  }
1183 
1196  {
1197  return is.terminal;
1198  }
1199 
1208  {
1209  is.terminal = val.val();
1210  if (val)
1211  is.inherently_weak = is.weak = val.val();
1212  }
1213 
1222  {
1223  return is.weak;
1224  }
1225 
1234  void prop_weak(trival val)
1235  {
1236  is.weak = val.val();
1237  if (val)
1238  is.inherently_weak = val.val();
1239  if (!val)
1240  is.very_weak = is.terminal = val.val();
1241  }
1242 
1252  {
1253  return is.very_weak;
1254  }
1255 
1264  {
1265  is.very_weak = val.val();
1266  if (val)
1267  is.weak = is.inherently_weak = val.val();
1268  }
1269 
1270 
1283  {
1284  return is.complete;
1285  }
1286 
1291  {
1292  is.complete = val.val();
1293  }
1294 
1307  {
1308  return is.universal;
1309  }
1310 
1319  {
1320  is.universal = val.val();
1321  if (val)
1322  // universal implies unambiguous and semi-deterministic
1323  is.unambiguous = is.semi_deterministic = val.val();
1324  }
1325 
1326  // Starting with Spot 2.4, and automaton is deterministic if it is
1327  // both universal and existential, but as we already have
1328  // twa::is_existential(), we only need to additionally record the
1329  // universal property. Before that, the deterministic property
1330  // was just a synonym for universal, hence we keep the deprecated
1331  // function prop_deterministic() with this meaning.
1332  SPOT_DEPRECATED("use prop_universal() instead")
1333  void prop_deterministic(trival val)
1334  {
1335  prop_universal(val);
1336  }
1337 
1338  SPOT_DEPRECATED("use prop_universal() instead")
1339  trival prop_deterministic() const
1340  {
1341  return prop_universal();
1342  }
1343 
1358  {
1359  return is.unambiguous;
1360  }
1361 
1369  {
1370  is.unambiguous = val.val();
1371  if (!val)
1372  is.universal = val.val();
1373  }
1374 
1388  {
1389  return is.semi_deterministic;
1390  }
1391 
1399  {
1400  is.semi_deterministic = val.val();
1401  if (!val)
1402  is.universal = val.val();
1403  }
1404 
1418  {
1419  return is.stutter_invariant;
1420  }
1421 
1424  {
1425  is.stutter_invariant = val.val();
1426  }
1427 
1467  struct prop_set
1468  {
1469  bool state_based;
1470  bool inherently_weak;
1471  bool deterministic;
1472  bool improve_det;
1473  bool complete;
1474  bool stutter_inv;
1475 
1476  prop_set()
1477  : state_based(false),
1478  inherently_weak(false),
1479  deterministic(false),
1480  improve_det(false),
1481  complete(false),
1482  stutter_inv(false)
1483  {
1484  }
1485 
1486  prop_set(bool state_based,
1487  bool inherently_weak,
1488  bool deterministic,
1489  bool improve_det,
1490  bool complete,
1491  bool stutter_inv)
1492  : state_based(state_based),
1493  inherently_weak(inherently_weak),
1494  deterministic(deterministic),
1495  improve_det(improve_det),
1496  complete(complete),
1497  stutter_inv(stutter_inv)
1498  {
1499  }
1500 
1501 #ifndef SWIG
1502  // The "complete" argument was added in Spot 2.4
1503  SPOT_DEPRECATED("prop_set() now takes 6 arguments")
1504  prop_set(bool state_based,
1505  bool inherently_weak,
1506  bool deterministic,
1507  bool improve_det,
1508  bool stutter_inv)
1509  : state_based(state_based),
1510  inherently_weak(inherently_weak),
1511  deterministic(deterministic),
1512  improve_det(improve_det),
1513  complete(false),
1514  stutter_inv(stutter_inv)
1515  {
1516  }
1517 #endif
1518 
1534  static prop_set all()
1535  {
1536  return { true, true, true, true, true, true };
1537  }
1538  };
1539 
1550  void prop_copy(const const_twa_ptr& other, prop_set p)
1551  {
1552  if (p.state_based)
1553  prop_state_acc(other->prop_state_acc());
1554  if (p.inherently_weak)
1555  {
1556  prop_terminal(other->prop_terminal());
1557  prop_weak(other->prop_weak());
1558  prop_very_weak(other->prop_very_weak());
1559  prop_inherently_weak(other->prop_inherently_weak());
1560  }
1561  if (p.deterministic)
1562  {
1563  prop_universal(other->prop_universal());
1564  prop_semi_deterministic(other->prop_semi_deterministic());
1565  prop_unambiguous(other->prop_unambiguous());
1566  }
1567  else if (p.improve_det)
1568  {
1569  if (other->prop_universal().is_true())
1570  {
1571  prop_universal(true);
1572  }
1573  else
1574  {
1575  if (other->prop_semi_deterministic().is_true())
1576  prop_semi_deterministic(true);
1577  if (other->prop_unambiguous().is_true())
1578  prop_unambiguous(true);
1579  }
1580  }
1581  if (p.complete)
1582  prop_complete(other->prop_complete());
1583  if (p.stutter_inv)
1584  prop_stutter_invariant(other->prop_stutter_invariant());
1585  }
1586 
1592  void prop_keep(prop_set p)
1593  {
1594  if (!p.state_based)
1595  prop_state_acc(trival::maybe());
1596  if (!p.inherently_weak)
1597  {
1598  prop_terminal(trival::maybe());
1599  prop_weak(trival::maybe());
1600  prop_very_weak(trival::maybe());
1601  prop_inherently_weak(trival::maybe());
1602  }
1603  if (!p.deterministic)
1604  {
1605  if (!(p.improve_det && prop_universal().is_true()))
1606  prop_universal(trival::maybe());
1607  if (!(p.improve_det && prop_semi_deterministic().is_true()))
1608  prop_semi_deterministic(trival::maybe());
1609  if (!(p.improve_det && prop_unambiguous().is_true()))
1610  prop_unambiguous(trival::maybe());
1611  }
1612  if (!p.complete)
1613  prop_complete(trival::maybe());
1614  if (!p.stutter_inv)
1615  prop_stutter_invariant(trival::maybe());
1616  }
1617 
1618  };
1619 
1620 #ifndef SWIG
1621  namespace internal
1622  {
1623  inline twa_succ_iterable::~twa_succ_iterable()
1624  {
1625  if (it_)
1626  aut_->release_iter(it_);
1627  }
1628  }
1629 #endif // SWIG
1630 
1633 
1636 
1639 
1642 
1645 
1648 
1651 
1654 }
Helper class to iterate over the successor of a state using the on-the-fly interface.
Definition: twa.hh:525
virtual ~state()
Destructor.
Definition: twa.hh:110
Definition: graph.hh:33
trival prop_terminal() const
Whether the automaton is terminal.
Definition: twa.hh:1195
std::unordered_set< const state *, state_ptr_hash, state_ptr_equal > state_set
Unordered set of abstract states.
Definition: twa.hh:190
Helper structure to iterate over the successor of a state using the on-the-fly interface.
Definition: twa.hh:486
An Equivalence Relation for state*.
Definition: twa.hh:150
Render state pointers unique via a hash table.
Definition: twa.hh:201
internal::twa_succ_iterable succ(const state *s) const
Build an iterable over the successors of s.
Definition: twa.hh:676
void prop_weak(trival val)
Set the weak property.
Definition: twa.hh:1234
void prop_complete(trival val)
Set the complete property.
Definition: twa.hh:1290
bdd ap_vars() const
The set of atomic propositions as a conjunction.
Definition: twa.hh:785
trival prop_weak() const
Whether the automaton is weak.
Definition: twa.hh:1221
void prop_inherently_weak(trival val)
Set the "inherently weak" proeprty.
Definition: twa.hh:1177
void prop_copy(const const_twa_ptr &other, prop_set p)
Copy the properties of another automaton.
Definition: twa.hh:1550
static formula ap(const std::string &name)
Build an atomic proposition.
Definition: formula.hh:816
twa_succ_iterator * iter_cache_
Any iterator returned via release_iter.
Definition: twa.hh:627
bdd_dict_ptr dict_
BDD dictionary used by the automaton.
Definition: twa.hh:629
A Transition-based ω-Automaton.
Definition: twa.hh:622
LTL/PSL formula interface.
void prop_stutter_invariant(trival val)
Set the stutter-invariant property.
Definition: twa.hh:1423
acc_cond & acc()
The acceptance condition of the automaton.
Definition: twa.hh:821
Abstract class for states.
Definition: twa.hh:50
Strict Weak Ordering for shared_state (shared_ptr<const state*>).
Definition: twa.hh:277
T * get_or_set_named_prop(std::string s)
Create or retrieve a named property.
Definition: twa.hh:1102
bdd_dict_ptr get_dict() const
Get the dictionary associated to the automaton.
Definition: twa.hh:710
Main class for temporal logic formula.
Definition: formula.hh:669
virtual bool next()=0
Jump to the next successor (if any).
void set_generalized_buchi(unsigned num)
Set generalized Büchi acceptance.
Definition: twa.hh:952
void copy_acceptance_of(const const_twa_ptr &a)
Copy the acceptance condition of another TωA.
Definition: twa.hh:928
void prop_universal(trival val)
Set the universal property.
Definition: twa.hh:1318
twa_graph_ptr complete(const const_twa_ptr &aut)
Clone a twa and complete it.
virtual bool first()=0
Position the iterator on the first successor (if any).
const acc_cond::acc_code & get_acceptance() const
Acceptance formula used by the automaton.
Definition: twa.hh:912
void set_named_prop(std::string s, T *val)
Declare a named property.
Definition: twa.hh:1048
const std::vector< formula > & ap() const
The vector of atomic propositions registered by this automaton.
Definition: twa.hh:779
const acc_cond & acc() const
The acceptance condition of the automaton.
Definition: twa.hh:816
void set_acceptance(unsigned num, const acc_cond::acc_code &c)
Set the acceptance condition of the automaton.
Definition: twa.hh:921
std::unordered_map< const state *, val, state_ptr_hash, state_ptr_equal > state_map
Unordered map of abstract states.
Definition: twa.hh:197
void prop_state_acc(trival val)
Set the state-based-acceptance property.
Definition: twa.hh:1143
trival prop_inherently_weak() const
Whether the automaton is inherently weak.
Definition: twa.hh:1165
std::unordered_set< shared_state, state_shared_ptr_hash, state_shared_ptr_equal > shared_state_set
Unordered set of shared states.
Definition: twa.hh:347
void prop_unambiguous(trival val)
Sets the unambiguous property.
Definition: twa.hh:1368
Hash Function for shared_state (shared_ptr<const state*>).
Definition: twa.hh:334
Iterate over the successors of a state.
Definition: twa.hh:397
void prop_semi_deterministic(trival val)
Sets the semi-deterministic property.
Definition: twa.hh:1398
void release_named_properties()
Destroy all named properties.
Definition: twa.hh:1118
Definition: acc.hh:31
int register_ap(formula ap)
Register an atomic proposition designated by ap.
Definition: twa.hh:727
const state * operator()(const state *s)
Canonicalize state pointer.
Definition: twa.hh:214
void prop_terminal(trival val)
Set the terminal property.
Definition: twa.hh:1207
A class implementing Kleene&#39;s three-valued logic.
Definition: trival.hh:33
trival prop_stutter_invariant() const
Whether the automaton is stutter-invariant.
Definition: twa.hh:1417
const state * is_new(const state *s)
Canonicalize state pointer.
Definition: twa.hh:226
Hash Function for state*.
Definition: twa.hh:174
trival prop_state_acc() const
Whether the automaton uses state-based acceptance.
Definition: twa.hh:1132
trival prop_unambiguous() const
Whether the automaton is unambiguous.
Definition: twa.hh:1357
void register_aps_from_dict()
Register all atomic propositions that have already be register by the bdd_dict for this automaton...
Definition: twa.hh:761
Definition: twa.hh:1621
trival prop_very_weak() const
Whether the automaton is very-weak.
Definition: twa.hh:1251
trival prop_complete() const
Whether the automaton is complete..
Definition: twa.hh:1282
void release_iter(twa_succ_iterator *i) const
Release an iterator after usage.
Definition: twa.hh:686
virtual int compare(const state *other) const =0
Compares two states (that come from the same automaton).
int register_ap(std::string ap)
Register an atomic proposition designated by ap.
Definition: twa.hh:739
trival prop_semi_deterministic() const
Whether the automaton is semi-deterministic.
Definition: twa.hh:1387
virtual size_t hash() const =0
Hash a state.
virtual void destroy() const
Release a state.
Definition: twa.hh:98
trival is_sba() const
Whether this is a state-based Büchi automaton.
Definition: twa.hh:1152
void prop_keep(prop_set p)
Keep only a subset of properties of the current automaton.
Definition: twa.hh:1592
static prop_set all()
A structure for selecting a set of automaton properties to copy.
Definition: twa.hh:1534
Definition: acc.hh:325
Strict Weak Ordering for state*.
Definition: twa.hh:127
Atomic proposition.
unsigned num_sets() const
Number of acceptance sets used by the automaton.
Definition: twa.hh:906
trival prop_universal() const
Whether the automaton is universal.
Definition: twa.hh:1306
acc_cond::mark_t set_buchi()
Set Büchi acceptance.
Definition: twa.hh:973
Definition: acc.hh:34
void copy_ap_of(const const_twa_ptr &a)
Copy the atomic propositions of another TωA.
Definition: twa.hh:934
void prop_very_weak(trival val)
Set the very-weak property.
Definition: twa.hh:1263
T * get_named_prop(std::string s) const
Retrieve a named property.
Definition: twa.hh:1081
An Equivalence Relation for shared_state (shared_ptr<const state*>).
Definition: twa.hh:305

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Tue Apr 18 2017 14:42:56 for spot by doxygen 1.8.13