|
spot
2.16
|
"Semi-internal" for translating LTL using MTBDDs More...
#include <spot/twaalgos/mtdswa.hh>
Public Member Functions | |
| simple_ltl_translator (const bdd_dict_ptr &dict, bool simplify_terms=true) | |
| Construct the translator with the given BDD dictionary. More... | |
| mtdswa_ptr | ltl_to_mtdswa (formula f, bool fuse_same_bdds) |
| Translate an LTL formula to an MTDSwA. More... | |
| mtdswa_ptr | ltl_to_mtdswa_synthesis (formula f, const std::vector< std::string > &outvars, bool realizability, int debug=-1) |
| Translate an LTL formula for synthesis to MTDSwA. More... | |
| bdd | ltl_to_mtbdd (formula f) |
| Convert an LTL formula to an MTBDD. More... | |
| formula | leaf_to_formula (int b, int term) const |
| Convert a leaf value to a formula. More... | |
| formula | terminal_to_formula (int t) const |
| Convert a terminal integer to a formula. More... | |
| int | formula_to_int (formula f) |
| Convert a formula to an integer key. More... | |
| int | formula_propeq_to_int (formula f) |
| Convert a propositional equivalence formula to int. More... | |
| int | formula_to_terminal (formula f) |
| Convert a formula to a terminal index. More... | |
| bdd | formula_to_terminal_bdd (formula f) |
| Convert a formula to a terminal BDD. More... | |
| int | formula_to_terminal_bdd_as_int (formula f) |
| Convert a formula to a terminal BDD integer. More... | |
| int | formula_propeq_to_terminal_bdd_as_int (formula f) |
| Convert propositional equiv formula to terminal BDD int. More... | |
| bdd | combine_and (bdd left, bdd right) |
| Combine two BDDs with logical AND. More... | |
| bdd | combine_or (bdd left, bdd right) |
| Combine two BDDs with logical OR. More... | |
| bdd | combine_implies (bdd left, bdd right) |
| Combine two BDDs with logical implication. More... | |
| bdd | combine_equiv (bdd left, bdd right) |
| Combine two BDDs with logical equivalence. More... | |
| bdd | combine_xor (bdd left, bdd right) |
| Combine two BDDs with exclusive OR. More... | |
| bdd | combine_not (bdd b) |
| Negate a BDD. More... | |
| bdd | propeq_encode (formula f, int level=0) |
| Encode a formula using propositional equivalences. More... | |
| formula | propeq_representative (formula f, bool isacc) |
| Get the representative formula for a propositional equiv. More... | |
| bddExtCache * | get_cache () |
| Return a pointer to the internal BDD cache. More... | |
"Semi-internal" for translating LTL using MTBDDs
It is public only to make it possible to demonstrate the inner working of the translation. Do not rely on the interface to be stable.
| spot::simple_ltl_translator::simple_ltl_translator | ( | const bdd_dict_ptr & | dict, |
| bool | simplify_terms = true |
||
| ) |
Construct the translator with the given BDD dictionary.
| bdd spot::simple_ltl_translator::combine_and | ( | bdd | left, |
| bdd | right | ||
| ) |
Combine two BDDs with logical AND.
| bdd spot::simple_ltl_translator::combine_equiv | ( | bdd | left, |
| bdd | right | ||
| ) |
Combine two BDDs with logical equivalence.
| bdd spot::simple_ltl_translator::combine_implies | ( | bdd | left, |
| bdd | right | ||
| ) |
Combine two BDDs with logical implication.
| bdd spot::simple_ltl_translator::combine_not | ( | bdd | b | ) |
Negate a BDD.
| bdd spot::simple_ltl_translator::combine_or | ( | bdd | left, |
| bdd | right | ||
| ) |
Combine two BDDs with logical OR.
| bdd spot::simple_ltl_translator::combine_xor | ( | bdd | left, |
| bdd | right | ||
| ) |
Combine two BDDs with exclusive OR.
| int spot::simple_ltl_translator::formula_propeq_to_int | ( | formula | f | ) |
Convert a propositional equivalence formula to int.
| int spot::simple_ltl_translator::formula_propeq_to_terminal_bdd_as_int | ( | formula | f | ) |
Convert propositional equiv formula to terminal BDD int.
| int spot::simple_ltl_translator::formula_to_int | ( | formula | f | ) |
Convert a formula to an integer key.
| int spot::simple_ltl_translator::formula_to_terminal | ( | formula | f | ) |
Convert a formula to a terminal index.
| bdd spot::simple_ltl_translator::formula_to_terminal_bdd | ( | formula | f | ) |
Convert a formula to a terminal BDD.
| int spot::simple_ltl_translator::formula_to_terminal_bdd_as_int | ( | formula | f | ) |
Convert a formula to a terminal BDD integer.
|
inline |
Return a pointer to the internal BDD cache.
| formula spot::simple_ltl_translator::leaf_to_formula | ( | int | b, |
| int | term | ||
| ) | const |
Convert a leaf value to a formula.
| bdd spot::simple_ltl_translator::ltl_to_mtbdd | ( | formula | f | ) |
Convert an LTL formula to an MTBDD.
| mtdswa_ptr spot::simple_ltl_translator::ltl_to_mtdswa | ( | formula | f, |
| bool | fuse_same_bdds | ||
| ) |
Translate an LTL formula to an MTDSwA.
| mtdswa_ptr spot::simple_ltl_translator::ltl_to_mtdswa_synthesis | ( | formula | f, |
| const std::vector< std::string > & | outvars, | ||
| bool | realizability, | ||
| int | debug = -1 |
||
| ) |
Translate an LTL formula for synthesis to MTDSwA.
| bdd spot::simple_ltl_translator::propeq_encode | ( | formula | f, |
| int | level = 0 |
||
| ) |
Encode a formula using propositional equivalences.
Get the representative formula for a propositional equiv.
| formula spot::simple_ltl_translator::terminal_to_formula | ( | int | t | ) | const |
Convert a terminal integer to a formula.
1.9.1