spot  2.7.2
twa.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2009, 2011, 2013-2018 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*,
190  state_ptr_hash, state_ptr_equal> state_set;
191 
195  template<class val>
196  using state_map = std::unordered_map<const state*, val,
197  state_ptr_hash, state_ptr_equal>;
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  // avoids 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,
347  state_shared_ptr_equal> shared_state_set;
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 
904  virtual twa_run_ptr exclusive_run(const_twa_ptr other) const;
905 
913  virtual twa_word_ptr exclusive_word(const_twa_ptr other) const;
914 
915  private:
916  acc_cond acc_;
917 
918  void set_num_sets_(unsigned num)
919  {
920  if (num < acc_.num_sets())
921  {
922  acc_.~acc_cond();
923  new (&acc_) acc_cond;
924  }
925  acc_.add_sets(num - acc_.num_sets());
926  }
927 
928  public:
930  unsigned num_sets() const
931  {
932  return acc_.num_sets();
933  }
934 
937  {
938  return acc_.get_acceptance();
939  }
940 
945  void set_acceptance(unsigned num, const acc_cond::acc_code& c)
946  {
947  set_num_sets_(num);
948  acc_.set_acceptance(c);
949  }
950 
954  void set_acceptance(const acc_cond& c)
955  {
956  acc_ = c;
957  }
958 
960  void copy_acceptance_of(const const_twa_ptr& a)
961  {
962  acc_ = a->acc();
963  }
964 
966  void copy_ap_of(const const_twa_ptr& a)
967  {
968  for (auto f: a->ap())
969  this->register_ap(f);
970  }
971 
984  void set_generalized_buchi(unsigned num)
985  {
986  set_num_sets_(num);
987  acc_.set_generalized_buchi();
988  }
989 
1002  void set_generalized_co_buchi(unsigned num)
1003  {
1004  set_num_sets_(num);
1005  acc_.set_generalized_co_buchi();
1006  }
1007 
1024  {
1025  set_generalized_buchi(1);
1026  return acc_.mark(0);
1027  }
1028 
1045  {
1046  set_generalized_co_buchi(1);
1047  return acc_.mark(0);
1048  }
1049 
1050  private:
1051  std::vector<formula> aps_;
1052  bdd bddaps_;
1053 
1055  struct bprop
1056  {
1057  trival::repr_t state_based_acc:2; // State-based acceptance.
1058  trival::repr_t inherently_weak:2; // Inherently Weak automaton.
1059  trival::repr_t weak:2; // Weak automaton.
1060  trival::repr_t terminal:2; // Terminal automaton.
1061  trival::repr_t universal:2; // Universal automaton.
1062  trival::repr_t unambiguous:2; // Unambiguous automaton.
1063  trival::repr_t stutter_invariant:2; // Stutter invariant language.
1064  trival::repr_t very_weak:2; // very-weak, or 1-weak
1065  trival::repr_t semi_deterministic:2; // semi-deterministic automaton.
1066  trival::repr_t complete:2; // Complete automaton.
1067  };
1068  union
1069  {
1070  unsigned props;
1071  bprop is;
1072  };
1073 
1074  protected:
1075 #ifndef SWIG
1076  // Dynamic properties, are given with a name and a destructor function.
1077  std::unordered_map<std::string,
1078  std::pair<void*,
1079  std::function<void(void*)>>> named_prop_;
1080 #endif
1081  void* get_named_prop_(std::string s) const;
1082 
1083  public:
1084 
1085 #ifndef SWIG
1086  void set_named_prop(std::string s,
1102  void* val, std::function<void(void*)> destructor);
1103 
1119  template<typename T>
1120  void set_named_prop(std::string s, T* val)
1121  {
1122  set_named_prop(s, val, [](void *p) { delete static_cast<T*>(p); });
1123  }
1124 
1135  void set_named_prop(std::string s, std::nullptr_t);
1136 
1152  template<typename T>
1153  T* get_named_prop(std::string s) const
1154  {
1155  if (void* p = get_named_prop_(s))
1156  return static_cast<T*>(p);
1157  else
1158  return nullptr;
1159  }
1160 
1173  template<typename T>
1174  T* get_or_set_named_prop(std::string s)
1175  {
1176  if (void* p = get_named_prop_(s))
1177  return static_cast<T*>(p);
1178 
1179  auto tmp = new T;
1180  set_named_prop(s, tmp);
1181  return tmp;
1182  }
1183 
1184 #endif
1185 
1191  {
1192  // Destroy all named properties.
1193  for (auto& np: named_prop_)
1194  np.second.second(np.second.first);
1195  named_prop_.clear();
1196  }
1197 
1205  {
1206  if (num_sets() == 0)
1207  return trival(true);
1208  return trival::from_repr_t(is.state_based_acc);
1209  }
1210 
1216  {
1217  is.state_based_acc = val.val();
1218  }
1219 
1224  trival is_sba() const
1225  {
1226  return prop_state_acc() && acc().is_buchi();
1227  }
1228 
1238  {
1239  return trival::from_repr_t(is.inherently_weak);
1240  }
1241 
1250  {
1251  is.inherently_weak = val.val();
1252  if (!val)
1253  is.very_weak = is.terminal = is.weak = val.val();
1254  }
1255 
1268  {
1269  return trival::from_repr_t(is.terminal);
1270  }
1271 
1280  {
1281  is.terminal = val.val();
1282  if (val)
1283  is.inherently_weak = is.weak = val.val();
1284  }
1285 
1294  {
1295  return trival::from_repr_t(is.weak);
1296  }
1297 
1306  void prop_weak(trival val)
1307  {
1308  is.weak = val.val();
1309  if (val)
1310  is.inherently_weak = val.val();
1311  if (!val)
1312  is.very_weak = is.terminal = val.val();
1313  }
1314 
1324  {
1325  return trival::from_repr_t(is.very_weak);
1326  }
1327 
1336  {
1337  is.very_weak = val.val();
1338  if (val)
1339  is.weak = is.inherently_weak = val.val();
1340  }
1341 
1342 
1355  {
1356  return trival::from_repr_t(is.complete);
1357  }
1358 
1363  {
1364  is.complete = val.val();
1365  }
1366 
1379  {
1380  return trival::from_repr_t(is.universal);
1381  }
1382 
1391  {
1392  is.universal = val.val();
1393  if (val)
1394  // universal implies unambiguous and semi-deterministic
1395  is.unambiguous = is.semi_deterministic = val.val();
1396  }
1397 
1398  // Starting with Spot 2.4, an automaton is deterministic if it is
1399  // both universal and existential, but as we already have
1400  // twa::is_existential(), we only need to additionally record the
1401  // universal property. Before that, the deterministic property
1402  // was just a synonym for universal, hence we keep the deprecated
1403  // function prop_deterministic() with this meaning.
1404  SPOT_DEPRECATED("use prop_universal() instead")
1405  void prop_deterministic(trival val)
1406  {
1407  prop_universal(val);
1408  }
1409 
1410  SPOT_DEPRECATED("use prop_universal() instead")
1411  trival prop_deterministic() const
1412  {
1413  return prop_universal();
1414  }
1415 
1430  {
1431  return trival::from_repr_t(is.unambiguous);
1432  }
1433 
1441  {
1442  is.unambiguous = val.val();
1443  if (!val)
1444  is.universal = val.val();
1445  }
1446 
1460  {
1461  return trival::from_repr_t(is.semi_deterministic);
1462  }
1463 
1471  {
1472  is.semi_deterministic = val.val();
1473  if (!val)
1474  is.universal = val.val();
1475  }
1476 
1490  {
1491  return trival::from_repr_t(is.stutter_invariant);
1492  }
1493 
1496  {
1497  is.stutter_invariant = val.val();
1498  }
1499 
1539  struct prop_set
1540  {
1541  bool state_based;
1542  bool inherently_weak;
1543  bool deterministic;
1544  bool improve_det;
1545  bool complete;
1546  bool stutter_inv;
1547 
1548  prop_set()
1549  : state_based(false),
1550  inherently_weak(false),
1551  deterministic(false),
1552  improve_det(false),
1553  complete(false),
1554  stutter_inv(false)
1555  {
1556  }
1557 
1558  prop_set(bool state_based,
1559  bool inherently_weak,
1560  bool deterministic,
1561  bool improve_det,
1562  bool complete,
1563  bool stutter_inv)
1564  : state_based(state_based),
1565  inherently_weak(inherently_weak),
1566  deterministic(deterministic),
1567  improve_det(improve_det),
1568  complete(complete),
1569  stutter_inv(stutter_inv)
1570  {
1571  }
1572 
1573 #ifndef SWIG
1574  // The "complete" argument was added in Spot 2.4
1575  SPOT_DEPRECATED("prop_set() now takes 6 arguments")
1576  prop_set(bool state_based,
1577  bool inherently_weak,
1578  bool deterministic,
1579  bool improve_det,
1580  bool stutter_inv)
1581  : state_based(state_based),
1582  inherently_weak(inherently_weak),
1583  deterministic(deterministic),
1584  improve_det(improve_det),
1585  complete(false),
1586  stutter_inv(stutter_inv)
1587  {
1588  }
1589 #endif
1590 
1606  static prop_set all()
1607  {
1608  return { true, true, true, true, true, true };
1609  }
1610  };
1611 
1622  void prop_copy(const const_twa_ptr& other, prop_set p)
1623  {
1624  if (p.state_based)
1625  prop_state_acc(other->prop_state_acc());
1626  if (p.inherently_weak)
1627  {
1628  prop_terminal(other->prop_terminal());
1629  prop_weak(other->prop_weak());
1630  prop_very_weak(other->prop_very_weak());
1631  prop_inherently_weak(other->prop_inherently_weak());
1632  }
1633  if (p.deterministic)
1634  {
1635  prop_universal(other->prop_universal());
1636  prop_semi_deterministic(other->prop_semi_deterministic());
1637  prop_unambiguous(other->prop_unambiguous());
1638  }
1639  else if (p.improve_det)
1640  {
1641  if (other->prop_universal().is_true())
1642  {
1643  prop_universal(true);
1644  }
1645  else
1646  {
1647  if (other->prop_semi_deterministic().is_true())
1648  prop_semi_deterministic(true);
1649  if (other->prop_unambiguous().is_true())
1650  prop_unambiguous(true);
1651  }
1652  }
1653  if (p.complete)
1654  prop_complete(other->prop_complete());
1655  if (p.stutter_inv)
1656  prop_stutter_invariant(other->prop_stutter_invariant());
1657  }
1658 
1664  void prop_keep(prop_set p)
1665  {
1666  if (!p.state_based)
1667  prop_state_acc(trival::maybe());
1668  if (!p.inherently_weak)
1669  {
1670  prop_terminal(trival::maybe());
1671  prop_weak(trival::maybe());
1672  prop_very_weak(trival::maybe());
1673  prop_inherently_weak(trival::maybe());
1674  }
1675  if (!p.deterministic)
1676  {
1677  if (!(p.improve_det && prop_universal().is_true()))
1678  prop_universal(trival::maybe());
1679  if (!(p.improve_det && prop_semi_deterministic().is_true()))
1680  prop_semi_deterministic(trival::maybe());
1681  if (!(p.improve_det && prop_unambiguous().is_true()))
1682  prop_unambiguous(trival::maybe());
1683  }
1684  if (!p.complete)
1685  prop_complete(trival::maybe());
1686  if (!p.stutter_inv)
1687  prop_stutter_invariant(trival::maybe());
1688  }
1689 
1690  void prop_reset()
1691  {
1692  prop_keep({});
1693  }
1694  };
1695 
1696 #ifndef SWIG
1697  namespace internal
1698  {
1699  inline twa_succ_iterable::~twa_succ_iterable()
1700  {
1701  if (it_)
1702  aut_->release_iter(it_);
1703  }
1704  }
1705 #endif // SWIG
1706 
1709 
1712 
1715 
1718 
1721 
1724 
1727 
1730 
1733 
1736 }
Helper class to iterate over the successors of a state using the on-the-fly interface.
Definition: twa.hh:525
virtual ~state()
Destructor.
Definition: twa.hh:110
Definition: automata.hh:26
trival prop_terminal() const
Whether the automaton is terminal.
Definition: twa.hh:1267
Helper structure to iterate over the successors 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:1306
void prop_complete(trival val)
Set the complete property.
Definition: twa.hh:1362
bdd ap_vars() const
The set of atomic propositions as a conjunction.
Definition: twa.hh:785
unsigned add_sets(unsigned num)
Add more sets to the acceptance condition.
Definition: acc.hh:1731
trival prop_weak() const
Whether the automaton is weak.
Definition: twa.hh:1293
void prop_inherently_weak(trival val)
Set the "inherently weak" property.
Definition: twa.hh:1249
mark_t mark(unsigned u) const
Build a mark_t with a single set.
Definition: acc.hh:1755
static formula ap(const std::string &name)
Build an atomic proposition.
Definition: formula.hh:832
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
const acc_code & get_acceptance() const
Retrieve the acceptance formula.
Definition: acc.hh:1360
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:1495
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:1174
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:685
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:984
void set_generalized_co_buchi(unsigned num)
Set generalized co-Büchi acceptance.
Definition: twa.hh:1002
void copy_acceptance_of(const const_twa_ptr &a)
Copy the acceptance condition of another TωA.
Definition: twa.hh:960
void prop_universal(trival val)
Set the universal property.
Definition: twa.hh:1390
virtual bool first()=0
Position the iterator on the first successor (if any).
void set_acceptance(const acc_cond &c)
Set the acceptance condition of the automaton.
Definition: twa.hh:954
const acc_cond::acc_code & get_acceptance() const
Acceptance formula used by the automaton.
Definition: twa.hh:936
void set_named_prop(std::string s, T *val)
Declare a named property.
Definition: twa.hh:1120
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:945
void prop_state_acc(trival val)
Set the state-based-acceptance property.
Definition: twa.hh:1215
void set_acceptance(const acc_code &code)
Change the acceptance formula.
Definition: acc.hh:1353
trival prop_inherently_weak() const
Whether the automaton is inherently weak.
Definition: twa.hh:1237
void prop_unambiguous(trival val)
Set the unambiguous property.
Definition: twa.hh:1440
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)
Set the semi-deterministic property.
Definition: twa.hh:1470
acc_cond::mark_t set_co_buchi()
Set co-Büchi acceptance.
Definition: twa.hh:1044
void release_named_properties()
Destroy all named properties.
Definition: twa.hh:1190
An acceptance condition.
Definition: acc.hh:58
void set_generalized_co_buchi()
Change the acceptance condition to generalized-co-Büchi, over all declared sets.
Definition: acc.hh:1446
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:1279
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:1489
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:1204
trival prop_unambiguous() const
Whether the automaton is unambiguous.
Definition: twa.hh:1429
void register_aps_from_dict()
Register all atomic propositions that have already been registered by the bdd_dict for this automaton...
Definition: twa.hh:761
Definition: twa.hh:1697
trival prop_very_weak() const
Whether the automaton is very-weak.
Definition: twa.hh:1323
unsigned num_sets() const
The number of sets used in the acceptance condition.
Definition: acc.hh:1842
trival prop_complete() const
Whether the automaton is complete.
Definition: twa.hh:1354
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:1459
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:1224
static prop_set all()
A structure for selecting a set of automaton properties to copy.
Definition: twa.hh:1606
An acceptance formula.
Definition: acc.hh:444
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:930
trival prop_universal() const
Whether the automaton is universal.
Definition: twa.hh:1378
acc_cond::mark_t set_buchi()
Set Büchi acceptance.
Definition: twa.hh:1023
void set_generalized_buchi()
Change the acceptance condition to generalized-Büchi, over all declared sets.
Definition: acc.hh:1439
An acceptance mark.
Definition: acc.hh:81
void copy_ap_of(const const_twa_ptr &a)
Copy the atomic propositions of another TωA.
Definition: twa.hh:966
void prop_very_weak(trival val)
Set the very-weak property.
Definition: twa.hh:1335
T * get_named_prop(std::string s) const
Retrieve a named property.
Definition: twa.hh:1153
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 Fri Feb 27 2015 10:00:07 for spot by doxygen 1.8.13