* tgbaalgos/reachiter.hh, tgbaalgos/reachiter.cc
(tgba_reachable_iterator::process_link): Take the state* as arguments in addition to the state numbers. * src/tgba/tgbaexplicit.hh, src/tgba/tgbaexplicit.cc (tgba_explicit::copy_acceptance_conditions_of): New method. * tgbaalgos/dupexp.cc (dupexp_iter::dupexp_iter): Call copy_acceptance_conditions_of. (dupexp_iter::process_state, duplex_iter::declare_state, dupexp_iter::name_): Remove. (dupexp_iter::process_link): Adjust prototype, and format the state here rather than in process_state. * tgbaalgos/stats.cc, tgbaalgos/dotty.cc: Adjust prototype of process_link.
This commit is contained in:
parent
b6f3faba38
commit
42b05c7a05
8 changed files with 62 additions and 47 deletions
|
|
@ -208,6 +208,16 @@ namespace spot
|
|||
all_acceptance_conditions_computed_ = false;
|
||||
}
|
||||
|
||||
void
|
||||
tgba_explicit::copy_acceptance_conditions_of(const tgba *a)
|
||||
{
|
||||
assert(neg_acceptance_conditions_ == bddtrue);
|
||||
assert(all_acceptance_conditions_computed_ == false);
|
||||
bdd f = a->neg_acceptance_conditions();
|
||||
dict_->register_acceptance_variables(f, this);
|
||||
neg_acceptance_conditions_ = f;
|
||||
}
|
||||
|
||||
void
|
||||
tgba_explicit::complement_all_acceptance_conditions()
|
||||
{
|
||||
|
|
|
|||
|
|
@ -1,4 +1,4 @@
|
|||
// Copyright (C) 2003 Laboratoire d'Informatique de Paris 6 (LIP6),
|
||||
// Copyright (C) 2003, 2004 Laboratoire d'Informatique de Paris 6 (LIP6),
|
||||
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
|
||||
// et Marie Curie.
|
||||
//
|
||||
|
|
@ -59,6 +59,13 @@ namespace spot
|
|||
/// This assumes that all variables in \a f are known from dict.
|
||||
void add_conditions(transition* t, bdd f);
|
||||
void declare_acceptance_condition(const ltl::formula* f);
|
||||
|
||||
/// \brief Copy the acceptance conditions of a tgba.
|
||||
///
|
||||
/// If used, this function should be called before creating any
|
||||
/// transition.
|
||||
void copy_acceptance_conditions_of(const tgba *a);
|
||||
|
||||
bool has_acceptance_condition(const ltl::formula* f) const;
|
||||
void add_acceptance_condition(transition* t, const ltl::formula* f);
|
||||
/// This assumes that all acceptance conditions in \a f are known from dict.
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue