spot
1.2.6
|
Public Member Functions | |
ta_succ_iterator_product_by_changeset (const state_ta_product *s, const ta *t, const kripke *k, bdd changeset) | |
void | next_kripke_dest () |
Move to the next successor in the Kripke structure. More... | |
void | first () |
Position the iterator on the first successor (if any). More... | |
void | next () |
Jump to the next successor (if any). More... | |
bool | done () const |
Check whether the iteration is finished. More... | |
state_ta_product * | current_state () const |
Get the state of the current successor. More... | |
bdd | current_condition () const |
Get the changeset on the transition leading to current successor. More... | |
bdd | current_acceptance_conditions () const |
Get the acceptance conditions on the transition leading to this successor. More... | |
bool | is_stuttering_transition () const |
Return true if the changeset of the current transition is empty. More... | |
Protected Member Functions | |
void | step_ () |
Internal routines to advance to the next successor. More... | |
void | next_non_stuttering_ () |
Protected Attributes | |
const state_ta_product * | source_ |
const ta * | ta_ |
const kripke * | kripke_ |
ta_succ_iterator * | ta_succ_it_ |
tgba_succ_iterator * | kripke_succ_it_ |
state_ta_product * | current_state_ |
bdd | current_condition_ |
bdd | current_acceptance_conditions_ |
bool | is_stuttering_transition_ |
bdd | kripke_source_condition |
state * | kripke_current_dest_state |
|
virtualinherited |
Get the acceptance conditions on the transition leading to this successor.
Implements spot::ta_succ_iterator.
|
virtualinherited |
Get the changeset on the transition leading to current successor.
This is a boolean function of atomic propositions.
Implements spot::ta_succ_iterator.
|
virtualinherited |
Get the state of the current successor.
Note that the same state may occur at different points in the iteration. These actually correspond to the same destination. It just means there were several transitions, with different conditions, leading to the same state.
The returned state should be destroyed (see state::destroy) by the caller after it is no longer used.
Implements spot::ta_succ_iterator.
|
virtualinherited |
Check whether the iteration is finished.
This function should be called after any call to first()
or next()
and before any enquiry about the current state.
The usual way to do this is with a for
loop.
for (s->first(); !s->done(); s->next()) ...
Implements spot::ta_succ_iterator.
|
virtualinherited |
Position the iterator on the first successor (if any).
This method can be called several times to make multiple passes over successors.
done()
to ensure there is a successor, even after first()
. A common trap is to assume that there is at least one successor: this is wrong. Implements spot::ta_succ_iterator.
|
inherited |
Return true if the changeset of the current transition is empty.
|
virtualinherited |
Jump to the next successor (if any).
done()
to ensure there is a successor. Implements spot::ta_succ_iterator.
void spot::ta_succ_iterator_product_by_changeset::next_kripke_dest | ( | ) |
Move to the next successor in the Kripke structure.
|
protectedinherited |
Internal routines to advance to the next successor.