21#include <spot/twa/twagraph.hh>
49 SPOT_API twa_graph_ptr
51 unsigned target_acc_number,
53 int target_state_number,
54 bool state_based =
false,
55 bool colored =
false);
63 SPOT_API twa_graph_ptr
65 unsigned target_acc_number,
67 bool state_based =
false,
69 bool colored =
false);
77 SPOT_API twa_graph_ptr
79 unsigned target_acc_number,
81 bool state_based =
false,
84 bool colored =
false);
96 SPOT_API twa_graph_ptr
98 unsigned target_acc_number,
100 bool state_based =
false,
102 bool colored =
false,
117 SPOT_API twa_graph_ptr
119 unsigned target_acc_number,
121 bool state_based =
false,
123 bool colored =
false,
144 SPOT_API twa_graph_ptr
145 sat_minimize(twa_graph_ptr aut,
const char* opt,
bool state_based =
false);
Definition: automata.hh:26
twa_graph_ptr dtwa_sat_minimize_incr(const const_twa_graph_ptr &a, unsigned target_acc_number, const acc_cond::acc_code &target_acc, bool state_based=false, int max_states=-1, bool colored=false, int param=2)
Attempt to minimize a deterministic TωA with a SAT solver.
twa_graph_ptr sat_minimize(twa_graph_ptr aut, const char *opt, bool state_based=false)
High-level interface to SAT-based minimization.
twa_graph_ptr dtwa_sat_synthetize(const const_twa_graph_ptr &a, unsigned target_acc_number, const acc_cond::acc_code &target_acc, int target_state_number, bool state_based=false, bool colored=false)
Attempt to synthetize an equivalent deterministic TωA with a SAT solver.
twa_graph_ptr dtwa_sat_minimize_assume(const const_twa_graph_ptr &a, unsigned target_acc_number, const acc_cond::acc_code &target_acc, bool state_based=false, int max_states=-1, bool colored=false, int param=6)
Attempt to minimize a deterministic TωA with a SAT solver.
twa_graph_ptr dtwa_sat_minimize(const const_twa_graph_ptr &a, unsigned target_acc_number, const acc_cond::acc_code &target_acc, bool state_based=false, int max_states=-1, bool colored=false)
Attempt to minimize a deterministic TωA with a SAT solver.
twa_graph_ptr dtwa_sat_minimize_dichotomy(const const_twa_graph_ptr &a, unsigned target_acc_number, const acc_cond::acc_code &target_acc, bool state_based=false, bool langmap=false, int max_states=-1, bool colored=false)
Attempt to minimize a deterministic TωA with a SAT solver.
An acceptance formula.
Definition: acc.hh:470