30#include <spot/misc/_config.h>
31#include <spot/misc/bitset.hh>
32#include <spot/misc/trival.hh>
45 SPOT_DEPRECATED(
"mark_t no longer relies on unsigned, stop using value_t")
46 typedef unsigned value_t;
65 [[noreturn]]
static void report_too_many_sets();
102 template<
class iterator>
103 mark_t(
const iterator& begin,
const iterator& end)
106 for (iterator i = begin; i != end; ++i)
107 if (SPOT_LIKELY(*i < SPOT_MAX_ACCSETS))
110 report_too_many_sets();
114 mark_t(std::initializer_list<unsigned> vals)
115 :
mark_t(vals.begin(), vals.end())
119 SPOT_DEPRECATED(
"use brace initialization instead")
140 return SPOT_MAX_ACCSETS;
150 return mark_t(_value_t::mone());
153 size_t hash() const noexcept
155 std::hash<
decltype(id)> h;
159 SPOT_DEPRECATED(
"compare mark_t to mark_t, not to unsigned")
160 bool operator==(
unsigned o)
const
162 SPOT_ASSERT(o == 0U);
167 SPOT_DEPRECATED(
"compare mark_t to mark_t, not to unsigned")
168 bool operator!=(
unsigned o)
const
170 SPOT_ASSERT(o == 0U);
175 bool operator==(mark_t o)
const
180 bool operator!=(mark_t o)
const
185 bool operator<(mark_t o)
const
190 bool operator<=(mark_t o)
const
195 bool operator>(mark_t o)
const
200 bool operator>=(mark_t o)
const
205 explicit operator bool()
const
210 bool has(
unsigned u)
const
212 return !!this->operator&(mark_t({0}) << u);
220 void clear(
unsigned u)
225 mark_t& operator&=(mark_t r)
231 mark_t& operator|=(mark_t r)
237 mark_t& operator-=(mark_t r)
243 mark_t& operator^=(mark_t r)
249 mark_t operator&(mark_t r)
const
259 mark_t operator-(mark_t r)
const
264 mark_t operator~()
const
269 mark_t operator^(mark_t r)
const
274#if SPOT_DEBUG || defined(SWIGPYTHON)
275# define SPOT_WRAP_OP(ins) \
280 catch (const std::runtime_error& e) \
282 report_too_many_sets(); \
285# define SPOT_WRAP_OP(ins) ins;
287 mark_t operator<<(
unsigned i)
const
289 SPOT_WRAP_OP(
return id << i);
292 mark_t& operator<<=(
unsigned i)
294 SPOT_WRAP_OP(
id <<= i;
return *
this);
297 mark_t operator>>(
unsigned i)
const
299 SPOT_WRAP_OP(
return id >> i);
302 mark_t& operator>>=(
unsigned i)
304 SPOT_WRAP_OP(
id >>= i;
return *
this);
308 mark_t strip(mark_t y)
const
322 auto rm = (~yv) & (yv - 1);
324 auto lm = ~(yv ^ (yv - 1));
325 xv = ((xv & lm) >> 1) | (xv & rm);
335 return !((*this) - m);
342 return *
this != m && this->subset(m);
358 return id.highest()+1;
370 return id.lowest()+1;
391 return id && !(
id & (
id - 1));
402 return !!(
id & (
id - 1));
417 template<
class iterator>
432 spot::internal::mark_container sets()
const;
435 friend std::ostream& operator<<(std::ostream& os,
mark_t m);
437 std::string as_string()
const
439 std::ostringstream os;
447 { Inf, Fin, InfNeg, FinNeg,
And,
Or };
478 struct SPOT_API
acc_code:
public std::vector<acc_word>
483 bool operator==(
const acc_code& other)
const
486 if (is_t() && other.
is_t())
488 unsigned pos = size();
489 if (other.size() != pos)
493 auto op = (*this)[pos - 1].sub.op;
494 auto sz = (*this)[pos - 1].sub.size;
495 if (other[pos - 1].sub.op !=
op ||
496 other[pos - 1].sub.size != sz)
500 case acc_cond::acc_op::And:
501 case acc_cond::acc_op::Or:
504 case acc_cond::acc_op::Inf:
505 case acc_cond::acc_op::InfNeg:
506 case acc_cond::acc_op::Fin:
507 case acc_cond::acc_op::FinNeg:
509 if (other[pos].mark != (*
this)[pos].mark)
517 bool operator<(
const acc_code& other)
const
520 if (is_t() && other.
is_t())
522 unsigned pos = size();
523 auto osize = other.size();
530 auto op = (*this)[pos - 1].sub.op;
531 auto oop = other[pos - 1].sub.op;
536 auto sz = (*this)[pos - 1].sub.size;
537 auto osz = other[pos - 1].sub.size;
544 case acc_cond::acc_op::And:
545 case acc_cond::acc_op::Or:
548 case acc_cond::acc_op::Inf:
549 case acc_cond::acc_op::InfNeg:
550 case acc_cond::acc_op::Fin:
551 case acc_cond::acc_op::FinNeg:
554 auto m = (*this)[pos].mark;
555 auto om = other[pos].mark;
567 bool operator>(
const acc_code& other)
const
569 return other < *
this;
572 bool operator<=(
const acc_code& other)
const
574 return !(other < *
this);
577 bool operator>=(
const acc_code& other)
const
579 return !(*
this < other);
582 bool operator!=(
const acc_code& other)
const
584 return !(*
this == other);
595 return s == 0 || ((*this)[s - 1].sub.op == acc_op::Inf
596 && !((*this)[s - 2].mark));
610 && (*this)[s - 1].sub.op == acc_op::Fin && !((*this)[s - 2].mark);
624 res[1].sub.op = acc_op::Fin;
650 res[1].sub.op = acc_op::Fin;
682 res[1].sub.op = acc_op::FinNeg;
689 return fin_neg(
mark_t(vals));
706 res[1].sub.op = acc_op::Inf;
738 res[1].sub.op = acc_op::InfNeg;
745 return inf_neg(
mark_t(vals));
775 m >>= mark_t::max_accsets() - n;
789 m >>= mark_t::max_accsets() - n;
802 res |= inf({2*n - 1}) & fin({2*n - 2});
817 res &= inf({2*n - 1}) | fin({2*n - 2});
835 template<
class Iterator>
840 for (Iterator i = begin; i != end; ++i)
844 for (
unsigned ni = *i; ni > 0; --ni)
846 auto pair = inf(m) & fin({f});
847 std::swap(pair, res);
848 res |= std::move(pair);
863 return parity(
true, is_odd, sets);
867 return parity_max(
true, sets);
871 return parity_max(
false, sets);
875 return parity(
false, is_odd, sets);
879 return parity_min(
true, sets);
883 return parity_min(
false, sets);
908 if (is_t() || r.
is_f())
913 if (is_f() || r.
is_t())
915 unsigned s = size() - 1;
916 unsigned rs = r.size() - 1;
919 if (((*
this)[s].sub.op == acc_op::Inf
920 && r[rs].sub.op == acc_op::Inf)
921 || ((*
this)[s].sub.op == acc_op::InfNeg
922 && r[rs].sub.op == acc_op::InfNeg))
924 (*this)[s - 1].mark |= r[rs - 1].mark;
934 if ((*
this)[s].sub.op == acc_op::And)
936 auto start = &(*this)[s] - (*this)[s].sub.size;
937 auto pos = &(*this)[s] - 1;
941 if (pos->sub.op == acc_op::Inf)
946 pos -= pos->sub.size + 1;
949 else if ((*
this)[s].sub.op == acc_op::Inf)
951 left_inf = &(*this)[s - 1];
954 const acc_word* right_inf =
nullptr;
955 auto right_end = &r.back();
956 if (right_end->sub.op == acc_op::And)
959 auto pos = --right_end;
962 if (pos->sub.op == acc_op::Inf)
967 pos -= pos->sub.size + 1;
970 else if (right_end->sub.op == acc_op::Inf)
972 right_inf = right_end - 1;
976 if (left_inf && right_inf)
978 carry = left_inf->mark;
979 auto pos = left_inf - &(*this)[0];
980 erase(begin() + pos, begin() + pos + 2);
983 insert(end(), &r[0], right_end + 1);
985 (*this)[sz + (right_inf - &r[0])].mark |= carry;
988 w.sub.op = acc_op::And;
1015 if (is_t() || r.
is_f())
1017 if (is_f() || r.
is_t())
1022 unsigned s = size() - 1;
1023 unsigned rs = r.size() - 1;
1025 if (((*
this)[s].sub.op == acc_op::Fin
1026 && r[rs].sub.op == acc_op::Fin)
1027 || ((*
this)[s].sub.op == acc_op::FinNeg
1028 && r[rs].sub.op == acc_op::FinNeg))
1030 (*this)[s - 1].mark |= r[rs - 1].mark;
1040 if ((*
this)[s].sub.op == acc_op::Or)
1042 auto start = &(*this)[s] - (*this)[s].sub.size;
1043 auto pos = &(*this)[s] - 1;
1047 if (pos->sub.op == acc_op::Fin)
1052 pos -= pos->sub.size + 1;
1055 else if ((*
this)[s].sub.op == acc_op::Fin)
1057 left_fin = &(*this)[s - 1];
1060 const acc_word* right_fin =
nullptr;
1061 auto right_end = &r.back();
1062 if (right_end->sub.op == acc_op::Or)
1065 auto pos = --right_end;
1068 if (pos->sub.op == acc_op::Fin)
1070 right_fin = pos - 1;
1073 pos -= pos->sub.size + 1;
1076 else if (right_end->sub.op == acc_op::Fin)
1078 right_fin = right_end - 1;
1082 if (left_fin && right_fin)
1084 carry = left_fin->mark;
1085 auto pos = (left_fin - &(*this)[0]);
1086 this->erase(begin() + pos, begin() + pos + 2);
1089 insert(end(), &r[0], right_end + 1);
1091 (*this)[sz + (right_fin - &r[0])].mark |= carry;
1093 w.sub.op = acc_op::Or;
1094 w.sub.size = size();
1124 if (SPOT_UNLIKELY(sets >= mark_t::max_accsets()))
1125 report_too_many_sets();
1128 unsigned pos = size();
1131 switch ((*
this)[pos - 1].sub.op)
1133 case acc_cond::acc_op::And:
1134 case acc_cond::acc_op::Or:
1137 case acc_cond::acc_op::Inf:
1138 case acc_cond::acc_op::InfNeg:
1139 case acc_cond::acc_op::Fin:
1140 case acc_cond::acc_op::FinNeg:
1142 (*this)[pos].mark <<= sets;
1322 std::tuple<int, acc_cond::acc_code, acc_cond::acc_code>
1324 std::tuple<int, acc_cond::acc_code, acc_cond::acc_code>
1340 std::vector<std::vector<int>>
1366 mark_t always_present)
const;
1417 std::vector<std::pair<acc_cond::mark_t, acc_cond::mark_t>>
1437 std::function<
void(std::ostream&,
int)>
1438 set_printer =
nullptr)
const;
1446 std::function<
void(std::ostream&,
int)>
1447 set_printer =
nullptr)
const;
1455 std::function<
void(std::ostream&,
int)>
1456 set_printer =
nullptr)
const;
1491 : std::vector<
acc_word>(other - other->sub.size, other + 1)
1508 : num_(0
U), all_({}), code_(code)
1511 uses_fin_acceptance_ = check_fin_acceptance();
1519 : num_(0
U), all_({}), code_(code)
1521 add_sets(code.used_sets().max_set());
1522 uses_fin_acceptance_ = check_fin_acceptance();
1527 : num_(o.num_), all_(o.all_), code_(o.code_),
1528 uses_fin_acceptance_(o.uses_fin_acceptance_)
1538 uses_fin_acceptance_ = o.uses_fin_acceptance_;
1552 uses_fin_acceptance_ = check_fin_acceptance();
1567 bool operator==(
const acc_cond& other)
const
1573 return (ocode == code_ || (ocode.is_t() && code_.is_t()));
1576 bool operator!=(
const acc_cond& other)
const
1578 return !(*
this == other);
1584 return uses_fin_acceptance_;
1590 return code_.is_t();
1599 return num_ == 0 && is_t();
1605 return code_.is_f();
1614 return num_ == 0 && is_f();
1623 unsigned s = code_.size();
1625 s == 2 && code_[1].sub.op == acc_op::Inf && code_[0].mark == all_sets();
1634 return num_ == 1 && is_generalized_co_buchi();
1641 set_acceptance(inf(all_sets()));
1648 set_acceptance(fin(all_sets()));
1657 unsigned s = code_.size();
1658 return (s == 0 && num_ == 0) || (s == 2 && code_[1].sub.op == acc_op::Inf
1659 && code_[0].mark == all_sets());
1668 unsigned s = code_.size();
1670 code_[1].sub.op == acc_op::Fin && code_[0].mark == all_sets());
1723 bool operator==(
rs_pair o)
const
1725 return fin == o.fin && inf == o.inf;
1727 bool operator!=(
rs_pair o)
const
1729 return fin != o.fin || inf != o.inf;
1731 bool operator<(
rs_pair o)
const
1733 return fin < o.fin || (!(o.fin < fin) && inf < o.inf);
1735 bool operator<=(
rs_pair o)
const
1737 return !(o < *
this);
1739 bool operator>(
rs_pair o)
const
1743 bool operator>=(
rs_pair o)
const
1745 return !(*
this < o);
1806 bool is_parity(
bool& max,
bool& odd,
bool equiv =
false)
const;
1815 return is_parity(max, odd);
1827 return acc_cond(num_, code_.unit_propagation());
1833 std::pair<bool, acc_cond::mark_t> unsat_mark()
const
1835 return sat_unsat_mark(
false);
1840 std::pair<bool, acc_cond::mark_t> sat_mark()
const
1842 return sat_unsat_mark(
true);
1846 bool check_fin_acceptance()
const;
1847 std::pair<bool, acc_cond::mark_t> sat_unsat_mark(
bool)
const;
1860 return acc_code::inf(mark);
1865 return inf(
mark_t(vals.begin(), vals.end()));
1887 return acc_code::inf_neg(mark);
1892 return inf_neg(
mark_t(vals.begin(), vals.end()));
1905 return acc_code::fin(mark);
1910 return fin(
mark_t(vals.begin(), vals.end()));
1932 return acc_code::fin_neg(mark);
1937 return fin_neg(
mark_t(vals.begin(), vals.end()));
1951 if (num > mark_t::max_accsets())
1952 report_too_many_sets();
1971 SPOT_ASSERT(u < num_sets());
1994 return code_.accepting(inf);
2004 return code_.inf_satisfiable(inf);
2020 return code_.maybe_accepting(infinitely_often, always_present);
2039 SPOT_DEPRECATED(
"Use operator<< instead.")
2040 std::ostream& format(std::ostream& os,
mark_t m)
const
2048 SPOT_DEPRECATED(
"Use operator<< or mark_t::as_string() instead.")
2049 std::
string format(mark_t m)
const
2051 std::ostringstream os;
2070 template<
class iterator>
2074 for (
unsigned x = 0; x < num_; ++x)
2079 auto all = comp(u |
mark_t({x}));
2082 for (iterator y = begin; y != end; ++y)
2112 return {num_sets(), code_.
remove(rem, missing)};
2122 { num_sets() - (all_sets() & rem).count(), code_.
strip(rem, missing) };
2128 return {num_sets(), code_.
force_inf(m)};
2135 return {num_sets(), code_.
remove(all_sets() - rem,
true)};
2149 std::string
name(
const char* fmt =
"alo")
const;
2166 return code_.fin_unit();
2183 return code_.mafins();
2199 return code_.inf_unit();
2208 return code_.fin_one();
2233 auto [f, c] = code_.fin_one_extract();
2234 return {f, {num_sets(), std::move(c)}};
2255 std::tuple<int, acc_cond, acc_cond>
2258 auto [f, l, r] = code_.fin_unit_one_split();
2259 return {f, {num_sets(), std::move(l)}, {num_sets(), std::move(r)}};
2261 std::tuple<int, acc_cond, acc_cond>
2264 auto [f, l, r] = code_.fin_unit_one_split_improved();
2265 return {f, {num_sets(), std::move(l)}, {num_sets(), std::move(r)}};
2298 bool uses_fin_acceptance_ =
false;
2303 typedef std::vector<acc_cond::rs_pair> rs_pairs;
2307 : pairs_(p), view_marks_(m) {}
2333 return !visible(p.inf) && visible(p.fin) ? p.fin
2342 return !visible(p.fin) && visible(p.inf) ? p.inf
2350 for (
const auto& p: pairs_)
2351 if (p.fin.has(mark) && visible(p.fin) && visible(p.inf))
2356 const rs_pairs& pairs()
const
2362 template<
typename filter>
2366 for (
const auto& p: pairs_)
2373 return !!(view_marks_ & v);
2376 const rs_pairs& pairs_;
2382 std::ostream& operator<<(std::ostream& os,
const acc_cond& acc);
2388 class SPOT_API mark_iterator
2391 typedef unsigned value_type;
2392 typedef const value_type& reference;
2393 typedef const value_type* pointer;
2394 typedef std::ptrdiff_t difference_type;
2395 typedef std::forward_iterator_tag iterator_category;
2397 mark_iterator() noexcept
2402 mark_iterator(acc_cond::mark_t m) noexcept
2407 bool operator==(mark_iterator m)
const
2412 bool operator!=(mark_iterator m)
const
2417 value_type operator*()
const
2420 return m_.min_set() - 1;
2423 mark_iterator& operator++()
2425 m_.clear(this->
operator*());
2429 mark_iterator operator++(
int)
2431 mark_iterator it = *
this;
2436 acc_cond::mark_t m_;
2439 class SPOT_API mark_container
2447 mark_iterator begin()
const
2451 mark_iterator end()
const
An acceptance condition.
Definition acc.hh:62
const acc_code & get_acceptance() const
Retrieve the acceptance formula.
Definition acc.hh:1556
bool inf_satisfiable(mark_t inf) const
Assuming that we will visit at least all sets in inf, is there any chance that we will satisfy the co...
Definition acc.hh:2002
mark_t all_sets() const
Construct a mark_t with all declared sets.
Definition acc.hh:1985
static acc_code fin_neg(mark_t mark)
Construct a generalized co-Büchi acceptance for complemented sets.
Definition acc.hh:1930
mark_t mafins() const
Find a Fin(i) that is mandatory.
Definition acc.hh:2181
static acc_code inf_neg(mark_t mark)
Construct a generalized Büchi acceptance for complemented sets.
Definition acc.hh:1885
acc_cond unit_propagation()
Remove superfluous Fin and Inf by unit propagation.
Definition acc.hh:1825
void set_generalized_co_buchi()
Change the acceptance condition to generalized-co-Büchi, over all declared sets.
Definition acc.hh:1646
std::pair< int, acc_cond > fin_one_extract() const
Return one acceptance set i that appears as Fin(i) in the condition, and all disjuncts containing it ...
Definition acc.hh:2231
static acc_code fin(mark_t mark)
Construct a generalized co-Büchi acceptance.
Definition acc.hh:1903
bool is_co_buchi() const
Whether the acceptance condition is "co-Büchi".
Definition acc.hh:1632
bool accepting(mark_t inf) const
Check whether visiting exactly all sets inf infinitely often satisfies the acceptance condition.
Definition acc.hh:1992
static acc_code inf(mark_t mark)
Construct a generalized Büchi acceptance.
Definition acc.hh:1858
bool is_generalized_buchi() const
Whether the acceptance condition is "generalized-Büchi".
Definition acc.hh:1655
static acc_code fin_neg(std::initializer_list< unsigned > vals)
Construct a generalized co-Büchi acceptance for complemented sets.
Definition acc.hh:1935
static acc_code inf(std::initializer_list< unsigned > vals)
Construct a generalized Büchi acceptance.
Definition acc.hh:1863
unsigned add_set()
Add a single set to the acceptance condition.
Definition acc.hh:1963
bool is_parity(bool &max, bool &odd, bool equiv=false) const
check is the acceptance condition matches one of the four type of parity acceptance defined in the HO...
std::vector< acc_cond > top_disjuncts() const
Return the top-level disjuncts.
mark_t mark(unsigned u) const
Build a mark_t with a single set.
Definition acc.hh:1969
void set_generalized_buchi()
Change the acceptance condition to generalized-Büchi, over all declared sets.
Definition acc.hh:1639
acc_cond force_inf(mark_t m) const
For all x in m, replaces Fin(x) by false.
Definition acc.hh:2126
acc_cond remove(mark_t rem, bool missing) const
Remove all the acceptance sets in rem.
Definition acc.hh:2110
acc_op
Operators for acceptance formulas.
Definition acc.hh:447
acc_cond(unsigned n_sets=0, const acc_code &code={})
Build an acceptance condition.
Definition acc.hh:1507
unsigned add_sets(unsigned num)
Add more sets to the acceptance condition.
Definition acc.hh:1945
bool is_parity() const
check is the acceptance condition matches one of the four type of parity acceptance defined in the HO...
Definition acc.hh:1811
bool is_t() const
Whether the acceptance formula is "t" (true)
Definition acc.hh:1588
bool is_generalized_rabin(std::vector< unsigned > &pairs) const
Is the acceptance condition generalized-Rabin?
mark_t comp(const mark_t &l) const
Complement a mark_t.
Definition acc.hh:1979
acc_cond & operator=(const acc_cond &o)
Copy an acceptance condition.
Definition acc.hh:1533
acc_code & get_acceptance()
Retrieve the acceptance formula.
Definition acc.hh:1562
static acc_code fin(std::initializer_list< unsigned > vals)
Construct a generalized co-Büchi acceptance.
Definition acc.hh:1908
bool is_generalized_co_buchi() const
Whether the acceptance condition is "generalized-co-Büchi".
Definition acc.hh:1666
std::tuple< int, acc_cond, acc_cond > fin_unit_one_split_improved() const
Split an acceptance condition, trying to select one unit-Fin.
Definition acc.hh:2262
acc_cond restrict_to(mark_t rem) const
Restrict an acceptance condition to a subset of set numbers that are occurring at some point.
Definition acc.hh:2133
trival maybe_accepting(mark_t infinitely_often, mark_t always_present) const
Check potential acceptance of an SCC.
Definition acc.hh:2018
std::string name(const char *fmt="alo") const
Return the name of this acceptance condition, in the specified format.
bool is_none() const
Whether the acceptance condition is "none".
Definition acc.hh:1612
void set_acceptance(const acc_code &code)
Change the acceptance formula.
Definition acc.hh:1549
int is_rabin() const
Check if the acceptance condition matches the Rabin acceptance of the HOA format.
bool is_rabin_like(std::vector< rs_pair > &pairs) const
Test whether an acceptance condition is Rabin-like and returns each Rabin pair in an std::vector<rs_p...
mark_t accepting_sets(mark_t inf) const
Return an accepting subset of inf.
bool is_all() const
Whether the acceptance condition is "all".
Definition acc.hh:1597
acc_cond strip(mark_t rem, bool missing) const
Remove acceptance sets, and shift set numbers.
Definition acc.hh:2119
int fin_one() const
Return one acceptance set i that appear as Fin(i) in the condition.
Definition acc.hh:2206
mark_t useless(iterator begin, iterator end) const
Compute useless acceptance sets given a list of mark_t that occur in an SCC.
Definition acc.hh:2071
int is_streett() const
Check if the acceptance condition matches the Streett acceptance of the HOA format.
mark_t fin_unit() const
Find a Fin(i) that is a unit clause.
Definition acc.hh:2164
bool is_generalized_streett(std::vector< unsigned > &pairs) const
Is the acceptance condition generalized-Streett?
acc_cond(const acc_code &code)
Build an acceptance condition.
Definition acc.hh:1518
acc_cond(const acc_cond &o)
Copy an acceptance condition.
Definition acc.hh:1526
static acc_code inf_neg(std::initializer_list< unsigned > vals)
Construct a generalized Büchi acceptance for complemented sets.
Definition acc.hh:1890
bool is_streett_like(std::vector< rs_pair > &pairs) const
Test whether an acceptance condition is Streett-like and returns each Streett pair in an std::vector<...
bool is_buchi() const
Whether the acceptance condition is "Büchi".
Definition acc.hh:1621
std::vector< acc_cond > top_conjuncts() const
Return the top-level conjuncts.
std::tuple< int, acc_cond, acc_cond > fin_unit_one_split() const
Split an acceptance condition, trying to select one unit-Fin.
Definition acc.hh:2256
mark_t inf_unit() const
Find a Inf(i) that is a unit clause.
Definition acc.hh:2197
bool uses_fin_acceptance() const
Whether the acceptance condition uses Fin terms.
Definition acc.hh:1582
bool is_f() const
Whether the acceptance formula is "f" (false)
Definition acc.hh:1603
unsigned num_sets() const
The number of sets used in the acceptance condition.
Definition acc.hh:2058
A class implementing Kleene's three-valued logic.
Definition trival.hh:34
op
Operator types.
Definition formula.hh:79
@ And
(omega-Rational) And
Definition automata.hh:27
const mc_rvalue operator|(const mc_rvalue &lhs, const mc_rvalue &rhs)
This function helps to find the output value from a set of threads that may have different values.
Definition mc.hh:131
An acceptance formula.
Definition acc.hh:479
static acc_code parity_max(bool is_odd, unsigned sets)
Build a parity acceptance condition.
Definition acc.hh:861
std::tuple< int, acc_cond::acc_code, acc_cond::acc_code > fin_unit_one_split() const
Split an acceptance condition, trying to select one unit-Fin.
std::vector< std::vector< int > > missing(mark_t inf, bool accepting) const
Help closing accepting or rejecting cycle.
mark_t mafins() const
Find a Fin(i) that is mandatory.
friend std::ostream & operator<<(std::ostream &os, const acc_code &code)
prints the acceptance formula as text
std::ostream & to_html(std::ostream &os, std::function< void(std::ostream &, int)> set_printer=nullptr) const
Print the acceptance formula as HTML.
static acc_code inf(mark_t m)
Construct a generalized Büchi acceptance.
Definition acc.hh:701
acc_code to_cnf() const
Convert the acceptance formula into disjunctive normal form.
acc_code operator&(acc_code &&r) const
Conjunct the current condition with r.
Definition acc.hh:1004
acc_code force_inf(mark_t m) const
For all x in m, replaces Fin(x) by false.
static acc_code inf_neg(std::initializer_list< unsigned > vals)
Construct a generalized Büchi acceptance for complemented sets.
Definition acc.hh:743
std::vector< std::pair< acc_cond::mark_t, acc_cond::mark_t > > useless_colors_patterns() const
Find patterns of useless colors.
trival maybe_accepting(mark_t infinitely_often, mark_t always_present) const
Check potential acceptance of an SCC.
acc_code operator|(const acc_code &r) const
Disjunct the current condition with r.
Definition acc.hh:1110
std::vector< acc_code > top_conjuncts() const
Return the top-level conjuncts.
acc_code operator|(acc_code &&r) const
Disjunct the current condition with r.
Definition acc.hh:1101
static acc_code fin(std::initializer_list< unsigned > vals)
Construct a generalized co-Büchi acceptance.
Definition acc.hh:655
bool is_dnf() const
Whether the acceptance formula is in disjunctive normal form.
std::vector< acc_code > top_disjuncts() const
Return the top-level disjuncts.
acc_code operator&(const acc_code &r) const
Conjunct the current condition with r.
Definition acc.hh:995
static acc_code inf(std::initializer_list< unsigned > vals)
Construct a generalized Büchi acceptance.
Definition acc.hh:711
static acc_code parity_min_even(unsigned sets)
Build a parity acceptance condition.
Definition acc.hh:881
static acc_code parity(bool is_max, bool is_odd, unsigned sets)
Build a parity acceptance condition.
mark_t used_once_sets() const
Return the sets that appears only once in the acceptance.
acc_code & operator<<=(unsigned sets)
Apply a left shift to all mark_t that appear in the condition.
Definition acc.hh:1122
bool is_f() const
Is this the "false" acceptance condition?
Definition acc.hh:605
static acc_code generalized_buchi(unsigned n)
Build a generalized-Büchi acceptance condition with n sets.
Definition acc.hh:770
static acc_code parity_min_odd(unsigned sets)
Build a parity acceptance condition.
Definition acc.hh:877
acc_code(const acc_word *other)
Copy a part of another acceptance formula.
Definition acc.hh:1490
mark_t fin_unit() const
Find a Fin(i) that is a unit clause.
static acc_code parity_max_even(unsigned sets)
Build a parity acceptance condition.
Definition acc.hh:869
static acc_code f()
Construct the "false" acceptance condition.
Definition acc.hh:619
bool accepting(mark_t inf) const
Check whether visiting exactly all sets inf infinitely often satisfies the acceptance condition.
static acc_code parity_max_odd(unsigned sets)
Build a parity acceptance condition.
Definition acc.hh:865
std::ostream & to_latex(std::ostream &os, std::function< void(std::ostream &, int)> set_printer=nullptr) const
Print the acceptance formula as LaTeX.
std::pair< int, acc_code > fin_one_extract() const
Return one acceptance set i that appears as Fin(i) in the condition, and all disjuncts containing it ...
bool is_t() const
Is this the "true" acceptance condition?
Definition acc.hh:591
acc_code operator<<(unsigned sets) const
Apply a left shift to all mark_t that appear in the condition.
Definition acc.hh:1153
static acc_code random(unsigned n, double reuse=0.0)
Build a random acceptance condition.
static acc_code rabin(unsigned n)
Build a Rabin condition with n pairs.
Definition acc.hh:797
acc_code()
Build an empty acceptance formula.
Definition acc.hh:1485
std::tuple< int, acc_cond::acc_code, acc_cond::acc_code > fin_unit_one_split_improved() const
Split an acceptance condition, trying to select one unit-Fin.
static acc_code cobuchi()
Build a co-Büchi acceptance condition.
Definition acc.hh:760
acc_code complement() const
Complement an acceptance formula.
static acc_code inf_neg(mark_t m)
Construct a generalized Büchi acceptance for complemented sets.
Definition acc.hh:733
bdd to_bdd(const bdd *map) const
Convert the acceptance formula into a BDD.
std::ostream & to_text(std::ostream &os, std::function< void(std::ostream &, int)> set_printer=nullptr) const
Print the acceptance formula as text.
int fin_one() const
Return one acceptance set i that appears as Fin(i) in the condition.
acc_cond::mark_t used_sets() const
Return the set of sets appearing in the condition.
std::pair< acc_cond::mark_t, acc_cond::mark_t > used_inf_fin_sets() const
Return the sets used as Inf or Fin in the acceptance condition.
acc_code strip(acc_cond::mark_t rem, bool missing) const
Remove acceptance sets, and shift set numbers.
acc_code(const char *input)
Construct an acc_code from a string.
static acc_code fin_neg(std::initializer_list< unsigned > vals)
Construct a generalized co-Büchi acceptance for complemented sets.
Definition acc.hh:687
acc_code & operator&=(const acc_code &r)
Conjunct the current condition in place with r.
Definition acc.hh:906
mark_t inf_unit() const
Find a Inf(i) that is a unit clause.
static acc_code streett(unsigned n)
Build a Streett condition with n pairs.
Definition acc.hh:812
static acc_code t()
Construct the "true" acceptance condition.
Definition acc.hh:633
std::vector< unsigned > symmetries() const
compute the symmetry class of the acceptance sets.
static acc_code fin_neg(mark_t m)
Construct a generalized co-Büchi acceptance for complemented sets.
Definition acc.hh:677
static acc_code parity_min(bool is_odd, unsigned sets)
Build a parity acceptance condition.
Definition acc.hh:873
static acc_code fin(mark_t m)
Construct a generalized co-Büchi acceptance.
Definition acc.hh:645
acc_code & operator|=(const acc_code &r)
Disjunct the current condition in place with r.
Definition acc.hh:1013
bool inf_satisfiable(mark_t inf) const
Assuming that we will visit at least all sets in inf, is there any chance that we will satisfy the co...
bool is_cnf() const
Whether the acceptance formula is in conjunctive normal form.
static acc_code buchi()
Build a Büchi acceptance condition.
Definition acc.hh:752
static acc_code generalized_co_buchi(unsigned n)
Build a generalized-co-Büchi acceptance condition with n sets.
Definition acc.hh:784
acc_code remove(acc_cond::mark_t rem, bool missing) const
Remove all the acceptance sets in rem.
acc_code to_dnf() const
Convert the acceptance formula into disjunctive normal form.
static acc_code generalized_rabin(Iterator begin, Iterator end)
Build a generalized Rabin condition.
Definition acc.hh:836
An acceptance mark.
Definition acc.hh:85
static constexpr unsigned max_accsets()
The maximum number of acceptance sets supported by this implementation.
Definition acc.hh:138
bool is_singleton() const
Whether the mark contains only one bit set.
Definition acc.hh:385
mark_t lowest() const
A mark_t where all bits have been removed except the lowest one.
Definition acc.hh:379
unsigned max_set() const
The number of the highest set used plus one.
Definition acc.hh:355
mark_t & remove_some(unsigned n)
Remove n bits that where set.
Definition acc.hh:409
static mark_t all()
A mark_t with all bits set to one.
Definition acc.hh:148
spot::internal::mark_container sets() const
Returns some iterable object that contains the used sets.
Definition acc.hh:2460
bool proper_subset(mark_t m) const
Whether the set of bits represented by *this is a proper subset of those represented by m.
Definition acc.hh:340
mark_t(const iterator &begin, const iterator &end)
Create a mark_t from a range of set numbers.
Definition acc.hh:103
unsigned count() const
Number of bits sets.
Definition acc.hh:346
mark_t()=default
Initialize an empty mark_t.
mark_t(std::initializer_list< unsigned > vals)
Create a mark_t from a list of set numbers.
Definition acc.hh:114
bool has_many() const
Whether the mark contains at least two bits set.
Definition acc.hh:396
unsigned min_set() const
The number of the lowest set used plus one.
Definition acc.hh:367
bool subset(mark_t m) const
Whether the set of bits represented by *this is a subset of those represented by m.
Definition acc.hh:333
void fill(iterator here) const
Fill a container with the indices of the bits that are set.
Definition acc.hh:418
Rabin/streett pairs used by is_rabin_like and is_streett_like.
Definition acc.hh:1709
A "node" in an acceptance formulas.
Definition acc.hh:457