* iface/gspn/eesrg.cc, iface/gspn/eesrg.hh, iface/gspn/gspn.cc,
iface/gspn/gspn.hh, src/tgba/bdddict.cc, src/tgba/bdddict.hh, src/tgba/bddprint.hh, src/tgba/succiter.hh, src/tgba/succiterconcrete.cc, src/tgba/succiterconcrete.hh, src/tgba/tgba.hh, src/tgba/tgbabddconcrete.cc, src/tgba/tgbabddconcrete.hh, src/tgba/tgbabddconcretefactory.cc, src/tgba/tgbabddconcretefactory.hh, src/tgba/tgbabddcoredata.cc, src/tgba/tgbabddcoredata.hh, src/tgba/tgbaexplicit.cc, src/tgba/tgbaexplicit.hh, src/tgba/tgbaproduct.cc, src/tgba/tgbaproduct.hh, src/tgba/tgbatba.cc, src/tgba/tgbatba.hh, src/tgbaalgos/dotty.cc, src/tgbaalgos/dupexp.cc, src/tgbaalgos/emptinesscheck.cc, src/tgbaalgos/emptinesscheck.hh, src/tgbaalgos/lbtt.cc, src/tgbaalgos/lbtt.hh, src/tgbaalgos/ltl2tgba_fm.cc, src/tgbaalgos/ltl2tgba_lacim.cc, src/tgbaalgos/save.cc, src/tgbatest/explicit.cc, src/tgbatest/ltl2tgba.cc, src/tgbaparse/tgbaparse.yy, wrap/python/tests/ltl2tgba.py: Rewrite `accepting condition' as `acceptance condition'. The symbols which have been renamed are: tgba::all_accepting_conditions tgba::neg_accepting_conditions succ_iterator::current_accepting_conditions bdd_dict::register_accepting_variable bdd_dict::register_accepting_variables bdd_dict::is_registered_accepting_variable tgba_bdd_concrete_factory::declare_accepting_condition tgba_bdd_core_data::accepting_conditions tgba_bdd_core_data::all_accepting_conditions tgba_explicit::declare_accepting_condition tgba_explicit::complement_all_accepting_conditions tgba_explicit::has_accepting_condition tgba_explicit::get_accepting_condition tgba_explicit::add_accepting_condition tgba_explicit::all_accepting_conditions tgba_explicit::neg_accepting_conditions state_tba_proxy::acceptance_cond accepting_cond_splitter
This commit is contained in:
parent
334ae6e757
commit
e341cc9ab6
37 changed files with 312 additions and 272 deletions
|
|
@ -31,17 +31,17 @@ namespace spot
|
|||
///
|
||||
/// Note that LBTT expects an automaton with transition
|
||||
/// labeled by propositional formulae, and generalized
|
||||
/// Büchi accepting conditions on \b states. This
|
||||
/// Büchi acceptance conditions on \b states. This
|
||||
/// is unlike our spot::tgba automata which put
|
||||
/// both generalized accepting conditions and propositional
|
||||
/// both generalized acceptance conditions and propositional
|
||||
/// formulae) on \b transitions.
|
||||
///
|
||||
/// This algorithm will therefore produce an automata where
|
||||
/// accepting conditions have been moved from each transition to
|
||||
/// acceptance conditions have been moved from each transition to
|
||||
/// previous state. In the worst case, doing so will multiply the
|
||||
/// number of states and transitions of the automata by
|
||||
/// <code>2^|Acc|</code>. where <code>|Acc|</code> is the number of
|
||||
/// accepting conditions used by the automata. (It can be a bit
|
||||
/// acceptance conditions used by the automata. (It can be a bit
|
||||
/// more because LBTT allows only for one initial state:
|
||||
/// lbtt_reachable() may also have to create an additional state in
|
||||
/// case the source initial state had to be split.) You have been
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue