23 #ifndef SPOT_TGBAALGOS_POWERSET_HH
24 # define SPOT_TGBAALGOS_POWERSET_HH
28 # include "tgba/tgbaexplicit.hh"
35 typedef std::set<const state*, state_ptr_less_than> power_state;
36 typedef std::map<int, power_state> power_map_data;
43 state_set::const_iterator i = states.begin();
44 while (i != states.end())
54 states_of(
int s)
const
56 return map_.find(s)->second;
60 canonicalize(
const state* s)
62 state_set::const_iterator i = states.find(s);
63 if (i != states.end())
136 unsigned threshold_states = 0,
137 unsigned threshold_cycles = 0);
168 unsigned threshold_states = 0,
169 unsigned threshold_cycles = 0,
171 const tgba* neg_aut = 0);
175 #endif // SPOT_TGBAALGOS_POWERSET_HH
SPOT_API tgba * tba_determinize_check(const tgba *aut, unsigned threshold_states=0, unsigned threshold_cycles=0, const ltl::formula *f=0, const tgba *neg_aut=0)
Determinize a TBA and make sure it is correct.
An Equivalence Relation for state*.
Definition: state.hh:139
Abstract class for states.
Definition: state.hh:40
Definition: tgbaexplicit.hh:758
virtual void destroy() const
Release a state.
Definition: state.hh:88
SPOT_API tgba_explicit_number * tba_determinize(const tgba *aut, unsigned threshold_states=0, unsigned threshold_cycles=0)
Determinize a TBA using the powerset construction.
Hash Function for state*.
Definition: state.hh:164
A Transition-based Generalized Büchi Automaton.
Definition: tgba.hh:67
SPOT_API tgba_explicit_number * tgba_powerset(const tgba *aut, power_map &pm, bool merge=true)
Build a deterministic automaton, ignoring acceptance conditions.
Definition: powerset.hh:33