21#include <spot/twa/twagraph.hh>
29 struct synthesis_info;
136 bool output_assignment =
true);
153 bool output_assignment =
true);
206 bool verbose =
false);
262 const std::string& signal_name);
bool is_split_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a split mealy machine.
twa_graph_ptr minimize_mealy(const const_twa_graph_ptr &mm, int premin=-1)
Minimizes an (in)completely specified mealy machine.
twa_graph_ptr terminating_mealy_to_buchi(const const_twa_graph_ptr &mealy, const std::string &signal_name)
Convert a terminating Mealy machine to a Büchi automaton.
twa_graph_ptr mealy_product(const const_twa_graph_ptr &left, const const_twa_graph_ptr &right)
Product between two mealy machines left and right.
bool is_split_mealy_specialization(const_twa_graph_ptr left, const_twa_graph_ptr right, bool verbose=false)
Test if the split mealy machine right is a specialization of the split mealy machine left.
bool is_mealy(const const_twa_graph_ptr &m)
Checks whether the automaton is a mealy machine.
bool is_separated_mealy(const const_twa_graph_ptr &m)
Checks whether the automaton is a separated mealy machine.
void simplify_mealy_here(twa_graph_ptr &m, int minimize_lvl, bool split_out)
Convenience function to call minimize_mealy or reduce_mealy. Uses the same convention as ltlsynt for ...
twa_graph_ptr split_separated_mealy(const const_twa_graph_ptr &m)
Split a separated mealy machine.
twa_graph_ptr reduce_mealy(const const_twa_graph_ptr &mm, bool output_assignment=true)
Reduce an (in)completely specified mealy machine.
void split_separated_mealy_here(const twa_graph_ptr &m)
Split a separated mealy machine.
void reduce_mealy_here(twa_graph_ptr &mm, bool output_assignment=true)
Reduce an (in)completely specified mealy machine in place.
twa_graph_ptr unsplit_mealy(const const_twa_graph_ptr &m)
The inverse of split_separated_mealy.
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:41
Definition automata.hh:26
bool is_input_deterministic_mealy(const const_twa_graph_ptr &m)
Checks whether a mealy machine is input deterministic.
Benchmarking data and options for synthesis.
Definition synthesis.hh:32