#include <tgbabddconcretefactory.hh>
Inheritance diagram for spot::tgba_bdd_concrete_factory:
Public Member Functions | |
tgba_bdd_concrete_factory (bdd_dict *dict) | |
virtual | ~tgba_bdd_concrete_factory () |
int | create_state (const ltl::formula *f) |
int | create_atomic_prop (const ltl::formula *f) |
void | declare_acceptance_condition (bdd b, const ltl::formula *a) |
const tgba_bdd_core_data & | get_core_data () const |
Get the core data for the new automata. | |
bdd_dict * | get_dict () const |
void | constrain_relation (bdd new_rel) |
Add a new constraint to the relation. | |
void | finish () |
Perfom final computations before the relation can be used. | |
Private Types | |
typedef Sgi::hash_map< const ltl::formula *, bdd, ptr_hash< ltl::formula > > | acc_map_ |
Private Attributes | |
tgba_bdd_core_data | data_ |
Core data for the new automata. | |
acc_map_ | acc_ |
BDD associated to each acceptance condition. |
|
|
|
|
|
|
|
Add a new constraint to the relation.
|
|
Create an atomic proposition variable for formula f.
|
|
Create a state variable for formula f.
|
|
Declare an acceptance condition. Formula such as 'f U g' or 'F g' make the promise that 'g' will be fulfilled eventually. So once one of this formula has been translated into a BDD, we use declare_acceptance_condition() to associate all other states to the acceptance set of 'g'.
|
|
Perfom final computations before the relation can be used. This function should be called after all propositions, state, acceptance conditions, and constraints have been declared, and before calling get_code_data() or get_dict(). |
|
Get the core data for the new automata.
Implements spot::tgba_bdd_factory. |
|
|
|
BDD associated to each acceptance condition.
|
|
Core data for the new automata.
|