22 #include <spot/twa/fwd.hh>
23 #include <spot/graph/graph.hh>
24 #include <spot/graph/ngraph.hh>
25 #include <spot/twa/bdddict.hh>
26 #include <spot/twa/twa.hh>
61 auto o = down_cast<const twa_graph_state*>(other);
71 virtual size_t hash()
const override
73 return reinterpret_cast<size_t>(
this);
100 : cond(bddfalse), acc({})
107 : cond(cond), acc(acc)
113 if (cond.id() < other.cond.id())
115 if (cond.id() > other.cond.id())
117 return acc < other.acc;
122 return cond.id() == other.cond.id() &&
133 template<
class Graph>
138 typedef typename Graph::edge edge;
139 typedef typename Graph::state_data_t state;
163 p_ = g_->edge_storage(p_).next_succ;
167 virtual bool done()
const override
174 SPOT_ASSERT(!done());
175 return &g_->state_data(g_->edge_storage(p_).dst);
178 virtual bdd
cond()
const override
180 SPOT_ASSERT(!done());
181 return g_->edge_data(p_).cond;
186 SPOT_ASSERT(!done());
187 return g_->edge_data(p_).acc;
213 typedef unsigned state_num;
214 static_assert(std::is_same<typename graph_t::state, state_num>::value,
219 mutable unsigned init_number_;
229 explicit twa_graph(
const const_twa_graph_ptr& other, prop_set p)
230 :
twa(other->get_dict()),
231 g_(other->g_), init_number_(other->init_number_)
233 copy_acceptance_of(other);
243 template <
typename State_Name,
244 typename Name_Hash = std::hash<State_Name>,
245 typename Name_Equal = std::equal_to<State_Name>>
248 template <
typename State_Name,
249 typename Name_Hash = std::hash<State_Name>,
250 typename Name_Equal = std::equal_to<State_Name>>
258 create_formula_namer()
260 return create_namer<formula>();
272 const graph_t& get_graph()
const
277 unsigned num_states()
const
282 unsigned num_edges()
const
287 void set_init_state(state_num s)
289 bool univ = is_univ_dest(s);
290 if (SPOT_UNLIKELY((!univ && s >= num_states())
293 throw std::invalid_argument
294 (
"set_init_state() called with nonexisting state");
299 void set_univ_init_state(I dst_begin, I dst_end)
301 auto ns = num_states();
302 for (I i = dst_begin; i != dst_end; ++i)
303 if (SPOT_UNLIKELY(*i >= ns))
304 throw std::invalid_argument
305 (
"set_univ_init_state() called with nonexisting state");
309 void set_univ_init_state(
const std::initializer_list<state_num>& il)
311 set_univ_init_state(il.begin(), il.end());
314 state_num get_init_state_number()
const
317 if (num_states() == 0)
318 throw std::runtime_error(
"automaton has no state at all");
324 unsigned n = get_init_state_number();
325 if (SPOT_UNLIKELY(!is_existential()))
326 throw std::runtime_error
327 (
"the abstract interface does not support alternating automata");
328 return state_from_number(n);
334 auto s = down_cast<const typename graph_t::state_storage_t*>(st);
337 if (this->iter_cache_)
340 down_cast<twa_graph_succ_iterator<graph_t>*>(this->iter_cache_);
341 it->recycle(s->succ);
342 this->iter_cache_ =
nullptr;
348 static constexpr
bool is_univ_dest(
const edge_storage_t& e)
350 return is_univ_dest(e.dst);
353 static constexpr
bool is_univ_dest(
unsigned s)
361 state_number(
const state* st)
const
363 auto s = down_cast<const typename graph_t::state_storage_t*>(st);
367 const twa_graph_state*
368 state_from_number(state_num n)
const
373 std::string format_state(
unsigned n)
const;
377 return format_state(state_number(st));
382 auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
386 unsigned edge_number(
const edge_storage_t& e)
const
391 twa_graph_edge_data& edge_data(
const twa_succ_iterator* it)
396 twa_graph_edge_data& edge_data(
unsigned t)
401 const twa_graph_edge_data& edge_data(
const twa_succ_iterator* it)
const
406 const twa_graph_edge_data& edge_data(
unsigned t)
const
411 edge_storage_t& edge_storage(
const twa_succ_iterator* it)
416 edge_storage_t& edge_storage(
unsigned t)
422 edge_storage(
const twa_succ_iterator* it)
const
427 const edge_storage_t edge_storage(
unsigned t)
const
437 unsigned new_states(
unsigned n)
442 unsigned new_edge(
unsigned src,
unsigned dst,
444 acc_cond::mark_t acc = {})
446 return g_.
new_edge(src, dst, cond, acc);
449 unsigned new_acc_edge(
unsigned src,
unsigned dst,
450 bdd cond,
bool acc =
true)
453 return g_.
new_edge(src, dst, cond, this->acc().all_sets());
459 unsigned new_univ_edge(
unsigned src, I begin, I end,
461 acc_cond::mark_t acc = {})
466 unsigned new_univ_edge(
unsigned src, std::initializer_list<unsigned> dst,
468 acc_cond::mark_t acc = {})
470 return g_.
new_univ_edge(src, dst.begin(), dst.end(), cond, acc);
474 internal::state_out<const graph_t>
475 out(
unsigned src)
const
481 internal::state_out<graph_t>
487 internal::killer_edge_iterator<graph_t>
488 out_iteraser(
unsigned src)
493 internal::const_universal_dests
494 univ_dests(
unsigned d)
const noexcept
496 return g_.univ_dests(d);
499 internal::const_universal_dests
500 univ_dests(
const edge_storage_t& e)
const noexcept
502 return g_.univ_dests(e);
513 SPOT_RETURN(g_.states());
515 SPOT_RETURN(g_.states());
517 internal::all_trans<const graph_t>
518 edges() const noexcept
524 internal::all_trans<graph_t>
531 auto edge_vector() const
532 SPOT_RETURN(g_.edge_vector());
534 SPOT_RETURN(g_.edge_vector());
537 bool is_dead_edge(
unsigned t)
const
542 bool is_dead_edge(
const graph_t::edge_storage_t& t)
const
608 const std::vector<bool>* to_merge_ptr =
nullptr);
645 typedef void (*shift_action)(
const std::vector<unsigned>& newst,
647 void purge_unreachable_states(shift_action* f =
nullptr,
648 void* action_data =
nullptr);
668 if (SPOT_UNLIKELY(!(
bool)prop_state_acc()))
669 throw std::runtime_error
670 (
"state_acc_sets() should only be called on "
671 "automata with state-based acceptance");
672 for (
auto& t: g_.
out(s))
687 if (SPOT_UNLIKELY(!(
bool)prop_state_acc()))
688 throw std::runtime_error
689 (
"state_is_accepting() should only be called on "
690 "automata with state-based acceptance");
691 for (
auto& t: g_.
out(s))
694 return acc().accepting(t.acc);
700 return state_is_accepting(state_number(s));
704 bool operator==(
const twa_graph& aut)
const
708 if (num_states() != aut.num_states() ||
709 num_edges() != aut.num_edges() ||
711 dests1.size() != dests2.size())
713 auto& trans1 = edge_vector();
714 auto& trans2 = aut.edge_vector();
715 if (!std::equal(trans1.begin() + 1, trans1.end(),
718 return std::equal(dests1.begin(), dests1.end(),
747 unsigned used_states);
751 void defrag_states(std::vector<
unsigned>&& newst,
752 unsigned used_states)
754 return defrag_states(newst, used_states);
774 const char* opt =
nullptr)
const;
778 #if __GNUC__ == 8 && __GNUC_MINOR__ == 2
779 # define SPOT_make_twa_graph__(...) \
780 std::shared_ptr<twa_graph>(new twa_graph(__VA_ARGS__))
782 # define SPOT_make_twa_graph__(...) \
783 std::make_shared<twa_graph>(__VA_ARGS__)
790 return SPOT_make_shared_enabled__(
twa_graph, dict);
798 return SPOT_make_shared_enabled__(
twa_graph, aut, p);
809 bool preserve_name_properties =
false)
811 twa_graph_ptr res = SPOT_make_shared_enabled__(
twa_graph, aut, p);
812 if (preserve_name_properties)
813 res->copy_named_properties_of(aut);
826 SPOT_API twa_graph_ptr
828 bool preserve_names =
false,
831 unsigned max_states = -(1U));
unsigned num_states() const
The number of states in the automaton.
Definition: graph.hh:658
internal::killer_edge_iterator< digraph > out_iteraser(state_storage_t &src)
Return a fake container with all edges leaving src, allowing erasure.
Definition: graph.hh:931
state new_states(unsigned n, Args &&... args)
Create n new states.
Definition: graph.hh:697
state new_state(Args &&... args)
Create a new states.
Definition: graph.hh:683
edge index_of_edge(const edge_storage_t &tt) const
Convert a storage reference into an edge number.
Definition: graph.hh:893
bool is_valid_edge(edge t) const
Test whether the given edge is valid.
Definition: graph.hh:997
edge_storage_t::data_t & edge_data(edge s)
return the Edgeg_Data of an edge.
Definition: graph.hh:766
const dests_vector_t & dests_vector() const
The vector used to store universal destinations.
Definition: graph.hh:1025
edge_storage_t & edge_storage(edge s)
return a reference to the storage of an edge
Definition: graph.hh:748
bool is_existential() const
Whether the automaton uses only existential branching.
Definition: graph.hh:672
internal::state_out< digraph > out(state src)
Return a fake container with all edges leaving src.
Definition: graph.hh:902
state new_univ_dests(I dst_begin, I dst_end)
Create a new universal destination group.
Definition: graph.hh:809
state_storage_t & state_storage(state s)
return a reference to the storage of a state
Definition: graph.hh:712
unsigned num_edges() const
The number of edges in the automaton.
Definition: graph.hh:666
state_storage_t::data_t & state_data(state s)
return the State_Data associated to a state
Definition: graph.hh:730
bool is_dead_edge(unsigned t) const
Tests whether an edge has been erased.
Definition: graph.hh:1009
edge new_univ_edge(state src, I dst_begin, I dst_end, Args &&... args)
Create a new universal edge.
Definition: graph.hh:844
edge new_edge(state src, state dst, Args &&... args)
Create a new edge.
Definition: graph.hh:785
internal::all_trans< const digraph > edges() const
Return a fake container with all edges (exluding erased edges)
Definition: graph.hh:961
This class is used to tell parallel algorithms what resources they may use.
Definition: common.hh:156
Abstract class for states.
Definition: twa.hh:51
Iterator used by the on-the-fly interface of twa_graph.
Definition: twagraph.hh:136
virtual bool next() override
Jump to the next successor (if any).
Definition: twagraph.hh:161
virtual bdd cond() const override
Get the condition on the edge leading to this successor.
Definition: twagraph.hh:178
virtual acc_cond::mark_t acc() const override
Get the acceptance mark of the edge leading to this successor.
Definition: twagraph.hh:184
virtual bool first() override
Position the iterator on the first successor (if any).
Definition: twagraph.hh:155
virtual const twa_graph_state * dst() const override
Get the destination state of the current edge.
Definition: twagraph.hh:172
virtual bool done() const override
Check whether the iteration is finished.
Definition: twagraph.hh:167
Graph-based representation of a TωA.
Definition: twagraph.hh:200
void copy_state_names_from(const const_twa_graph_ptr &other)
Define the state names of this automaton using the names from other.
void merge_univ_dests()
Merge common universal destinations.
virtual twa_succ_iterator * succ_iter(const state *st) const override
Get an iterator over the successors of local_state.
Definition: twagraph.hh:332
void merge_edges()
Merge edges that can be merged.
void kill_state(unsigned state)
Make a state dead.
unsigned merge_states_of(bool stable=true, const std::vector< bool > *to_merge_ptr=nullptr)
Like merge states, but one can chose which states are candidates for merging.
bool state_is_accepting(unsigned s) const
Tell if a state is accepting.
Definition: twagraph.hh:685
void remove_unused_ap()
Remove unused atomic propositions.
void purge_dead_states()
Remove all dead states.
void defrag_states(std::vector< unsigned > &newst, unsigned used_states)
Renumber all states, and drop some.
bool state_is_accepting(const state *s) const
Tell if a state is accepting.
Definition: twagraph.hh:698
virtual const twa_graph_state * get_init_state() const override
Get the initial state of the automaton.
Definition: twagraph.hh:322
unsigned merge_states(parallel_policy ppolicy=parallel_policy())
Merge states that can be merged.
virtual std::string format_state(const state *st) const override
Format the state as a string for printing.
Definition: twagraph.hh:375
acc_cond::mark_t state_acc_sets(unsigned s) const
Return the marks associated to a state if the acceptance is state-based.
Definition: twagraph.hh:666
bool is_existential() const
Whether the automaton uses only existential branching.
Definition: twagraph.hh:506
void dump_storage_as_dot(std::ostream &out, const char *opt=nullptr) const
Print the data structures used to represent the automaton in dot's format.
Iterate over the successors of a state.
Definition: twa.hh:398
A Transition-based ω-Automaton.
Definition: twa.hh:623
unsigned num_sets() const
Number of acceptance sets used by the automaton.
Definition: twa.hh:934
twa_graph_ptr make_twa_graph(const bdd_dict_ptr &dict)
Build an explicit automaton from all states of aut,.
Definition: twagraph.hh:788
Definition: automata.hh:27
void prop_copy(const const_twa_ptr &other, prop_set p)
Copy the properties of another automaton.
Definition: twa.hh:1627
An acceptance mark.
Definition: acc.hh:85
Data attached to edges of a twa_graph.
Definition: twagraph.hh:95
Graph-based representation of a TωA.
Definition: twagraph.hh:40
virtual void destroy() const override
Release a state.
Definition: twagraph.hh:82
virtual int compare(const spot::state *other) const override
Compares two states (that come from the same automaton).
Definition: twagraph.hh:59
virtual size_t hash() const override
Hash a state.
Definition: twagraph.hh:71
virtual twa_graph_state * clone() const override
Duplicate a state.
Definition: twagraph.hh:77