26 #include <spot/twa/fwd.hh> 27 #include <spot/twa/acc.hh> 28 #include <spot/twa/bdddict.hh> 31 #include <unordered_map> 35 #include <spot/misc/casts.hh> 36 #include <spot/misc/hash.hh> 38 #include <spot/misc/trival.hh> 43 typedef std::shared_ptr<twa_run> twa_run_ptr;
46 typedef std::shared_ptr<twa_word> twa_word_ptr;
63 virtual int compare(
const state* other)
const = 0;
84 virtual size_t hash()
const = 0;
87 virtual state* clone()
const = 0;
130 operator()(
const state* left,
const state* right)
const 133 return left->
compare(right) < 0;
153 operator()(
const state* left,
const state* right)
const 156 return 0 == left->
compare(right);
177 operator()(
const state* that)
const 189 typedef std::unordered_set<
const state*,
196 using state_map = std::unordered_map<
const state*, val,
216 auto p = m.insert(s);
228 auto p = m.insert(s);
239 for (state_set::iterator i = m.begin(); i != m.end();)
243 state_set::iterator old = i++;
260 typedef std::shared_ptr<const state> shared_state;
262 inline void shared_state_deleter(state* s) { s->
destroy(); }
280 operator()(shared_state left,
281 shared_state right)
const 284 return left->compare(right.get()) < 0;
308 operator()(shared_state left,
309 shared_state right)
const 312 return 0 == left->compare(right.get());
337 operator()(shared_state that)
const 345 typedef std::unordered_set<shared_state,
422 virtual bool first() = 0;
434 virtual bool next() = 0;
451 virtual bool done()
const = 0;
467 virtual const state* dst()
const = 0;
471 virtual bdd cond()
const = 0;
537 : aut_(other.aut_), it_(other.it_)
546 return it_->
first() ? it_ :
nullptr;
622 class SPOT_API
twa:
public std::enable_shared_from_this<twa>
625 twa(
const bdd_dict_ptr& d);
639 virtual const state* get_init_state()
const = 0;
649 succ_iter(
const state* local_state)
const = 0;
678 return {
this, succ_iter(s)};
729 int res = dict_->has_registered_proposition(ap,
this);
732 aps_.emplace_back(ap);
733 res = dict_->register_proposition(ap,
this);
734 bddaps_ &= bdd_ithvar(res);
748 void unregister_ap(
int num);
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())
772 aps_.emplace_back(m[n].f);
773 bddaps_ &= bdd_ithvar(n);
779 const std::vector<formula>&
ap()
const 796 virtual std::string format_state(
const state* s)
const = 0;
811 virtual state* project_state(
const state* s,
812 const const_twa_ptr& t)
const;
831 virtual bool is_empty()
const;
845 virtual twa_run_ptr accepting_run()
const;
856 virtual twa_word_ptr accepting_word()
const;
860 virtual bool intersects(const_twa_ptr other)
const;
879 virtual twa_run_ptr intersecting_run(const_twa_ptr other,
880 bool from_other =
false)
const;
889 virtual twa_word_ptr intersecting_word(const_twa_ptr other)
const;
904 virtual twa_run_ptr exclusive_run(const_twa_ptr other)
const;
913 virtual twa_word_ptr exclusive_word(const_twa_ptr other)
const;
918 void set_num_sets_(
unsigned num)
968 for (
auto f: a->ap())
969 this->register_ap(f);
1025 set_generalized_buchi(1);
1026 return acc_.
mark(0);
1046 set_generalized_co_buchi(1);
1047 return acc_.
mark(0);
1051 std::vector<formula> aps_;
1057 trival::repr_t state_based_acc:2;
1058 trival::repr_t inherently_weak:2;
1059 trival::repr_t weak:2;
1060 trival::repr_t terminal:2;
1061 trival::repr_t universal:2;
1062 trival::repr_t unambiguous:2;
1063 trival::repr_t stutter_invariant:2;
1064 trival::repr_t very_weak:2;
1065 trival::repr_t semi_deterministic:2;
1066 trival::repr_t complete:2;
1077 std::unordered_map<std::string,
1079 std::function<void(void*)>>> named_prop_;
1081 void* get_named_prop_(std::string s)
const;
1086 void set_named_prop(std::string s,
1102 void* val, std::function<
void(
void*)> destructor);
1119 template<
typename T>
1122 set_named_prop(s, val, [](
void *p) {
delete static_cast<T*
>(p); });
1135 void set_named_prop(std::string s, std::nullptr_t);
1152 template<
typename T>
1155 if (
void* p = get_named_prop_(s))
1156 return static_cast<T*
>(p);
1173 template<
typename T>
1176 if (
void* p = get_named_prop_(s))
1177 return static_cast<T*
>(p);
1180 set_named_prop(s, tmp);
1193 for (
auto& np: named_prop_)
1194 np.second.second(np.second.first);
1195 named_prop_.clear();
1206 if (num_sets() == 0)
1208 return trival::from_repr_t(is.state_based_acc);
1217 is.state_based_acc = val.val();
1226 return prop_state_acc() && acc().is_buchi();
1239 return trival::from_repr_t(is.inherently_weak);
1251 is.inherently_weak = val.val();
1253 is.very_weak = is.terminal = is.weak = val.val();
1269 return trival::from_repr_t(is.terminal);
1281 is.terminal = val.val();
1283 is.inherently_weak = is.weak = val.val();
1295 return trival::from_repr_t(is.weak);
1308 is.weak = val.val();
1310 is.inherently_weak = val.val();
1312 is.very_weak = is.terminal = val.val();
1325 return trival::from_repr_t(is.very_weak);
1337 is.very_weak = val.val();
1339 is.weak = is.inherently_weak = val.val();
1356 return trival::from_repr_t(is.complete);
1364 is.complete = val.val();
1380 return trival::from_repr_t(is.universal);
1392 is.universal = val.val();
1395 is.unambiguous = is.semi_deterministic = val.val();
1404 SPOT_DEPRECATED(
"use prop_universal() instead")
1405 void prop_deterministic(
trival val)
1407 prop_universal(val);
1410 SPOT_DEPRECATED(
"use prop_universal() instead")
1411 trival prop_deterministic()
const 1413 return prop_universal();
1431 return trival::from_repr_t(is.unambiguous);
1442 is.unambiguous = val.val();
1444 is.universal = val.val();
1461 return trival::from_repr_t(is.semi_deterministic);
1472 is.semi_deterministic = val.val();
1474 is.universal = val.val();
1491 return trival::from_repr_t(is.stutter_invariant);
1497 is.stutter_invariant = val.val();
1542 bool inherently_weak;
1549 : state_based(
false),
1550 inherently_weak(
false),
1551 deterministic(
false),
1558 prop_set(
bool state_based,
1559 bool inherently_weak,
1564 : state_based(state_based),
1565 inherently_weak(inherently_weak),
1566 deterministic(deterministic),
1567 improve_det(improve_det),
1569 stutter_inv(stutter_inv)
1575 SPOT_DEPRECATED(
"prop_set() now takes 6 arguments")
1576 prop_set(
bool state_based,
1577 bool inherently_weak,
1581 : state_based(state_based),
1582 inherently_weak(inherently_weak),
1583 deterministic(deterministic),
1584 improve_det(improve_det),
1586 stutter_inv(stutter_inv)
1608 return {
true,
true,
true,
true,
true,
true };
1622 void prop_copy(
const const_twa_ptr& other, prop_set p)
1625 prop_state_acc(other->prop_state_acc());
1626 if (p.inherently_weak)
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());
1633 if (p.deterministic)
1635 prop_universal(other->prop_universal());
1636 prop_semi_deterministic(other->prop_semi_deterministic());
1637 prop_unambiguous(other->prop_unambiguous());
1639 else if (p.improve_det)
1641 if (other->prop_universal().is_true())
1643 prop_universal(
true);
1647 if (other->prop_semi_deterministic().is_true())
1648 prop_semi_deterministic(
true);
1649 if (other->prop_unambiguous().is_true())
1650 prop_unambiguous(
true);
1654 prop_complete(other->prop_complete());
1656 prop_stutter_invariant(other->prop_stutter_invariant());
1664 void prop_keep(prop_set p)
1667 prop_state_acc(trival::maybe());
1668 if (!p.inherently_weak)
1670 prop_terminal(trival::maybe());
1671 prop_weak(trival::maybe());
1672 prop_very_weak(trival::maybe());
1673 prop_inherently_weak(trival::maybe());
1675 if (!p.deterministic)
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());
1685 prop_complete(trival::maybe());
1687 prop_stutter_invariant(trival::maybe());
1699 inline twa_succ_iterable::~twa_succ_iterable()
1702 aut_->release_iter(it_);
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
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
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
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'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
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
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