21 #include <spot/twa/twagraph.hh>
22 #include <spot/twaalgos/powerset.hh>
50 std::map<unsigned, int> state_to_var;
51 std::map<int, unsigned> var_to_state;
78 throw std::runtime_error
79 (
"state_and() expects a non-empty list of states");
81 bdd combination = bddtrue;
83 combination &= combiner(*begin++);
84 unsigned new_s = aut->new_state();
92 const std::initializer_list<T>& il)
117 bool named_states =
false,
119 bool raise_if_too_many_sets =
true);
136 : states_(other.states_), is_reset_(other.is_reset_)
143 const std::set<unsigned>&
states()
const;
156 std::vector<int> state_to_var_;
157 std::map<int, unsigned> var_to_state_;
Helper class to combine outgoing edges in alternating automata.
Definition: alternation.hh:47
bdd operator()(unsigned st)
Combine outgoing edges of state st.
void new_dests(unsigned st, bdd out) const
Compute new destinations for state st under condition out.
outedge_combiner(const twa_graph_ptr &aut)
Construct from an alternating automaton.
Helper object to specify when an algorithm should abort its construction.
Definition: powerset.hh:50
Abstract class for states.
Definition: twa.hh:49
Iterate over the successors of a state.
Definition: twa.hh:425
On-the-fly TωA that removes universal edges from an alternating automaton.
Definition: alternation.hh:152
twa_univ_remover(const const_twa_graph_ptr &aut)
Construct from an alternating automaton.
twa_succ_iterator * succ_iter(const state *s) const override
Get an iterator over the successors of local_state.
std::string format_state(const state *s) const override
Format the state as a string for printing.
const state * get_init_state() const override
Get the initial state of the automaton.
void allocate_state_vars()
Allocate BDD variables for the states.
A Transition-based ω-Automaton.
Definition: twa.hh:648
State used during on-the-fly removal of universal edges from an alternating automaton.
Definition: alternation.hh:126
size_t hash() const override
Hash a state.
const std::set< unsigned > & states() const
Return the set of original states.
int compare(const state *other) const override
Compares two states (that come from the same automaton).
std::set< unsigned > states_
The set of original states represented.
Definition: alternation.hh:128
bool is_reset() const
Check if this is a reset state.
bool is_reset_
Whether this state represents a reset.
Definition: alternation.hh:129
univ_remover_state(const std::set< unsigned > &states)
Construct a state from a set of original states.
univ_remover_state(const univ_remover_state &other)
Copy constructor.
Definition: alternation.hh:135
state * clone() const override
Duplicate a state.
std::shared_ptr< twa_univ_remover > twa_univ_remover_ptr
Shared pointer to a twa_univ_remover.
Definition: alternation.hh:172
twa_univ_remover_ptr remove_univ_otf(const const_twa_graph_ptr &aut)
Remove universal edges on the fly from an alternating Büchi automaton.
twa_graph_ptr remove_alternation(const const_twa_graph_ptr &aut, bool named_states=false, const output_aborter *aborter=nullptr, bool raise_if_too_many_sets=true)
Remove universal edges from a weak alternating automaton.
unsigned states_and(const twa_graph_ptr &aut, I begin, I end)
Combine two states in a conjunction.
Definition: alternation.hh:75
std::shared_ptr< twa_graph > twa_graph_ptr
Shared pointer to a mutable twa_graph.
Definition: fwd.hh:44
std::shared_ptr< const twa_graph > const_twa_graph_ptr
Shared pointer to a const twa_graph.
Definition: fwd.hh:38
Definition: automata.hh:26