spot
1.2.4
|
Iterate over the successors of a saba_state. More...
#include <saba/sabasucciter.hh>
Public Member Functions | |
Iteration | |
virtual void | first ()=0 |
Position the iterator on the first conjunction of successors (if any). More... | |
virtual void | next ()=0 |
Jump to the next conjunction of successors (if any). More... | |
virtual bool | done () const =0 |
Check whether the iteration is finished. More... | |
Inspection | |
virtual saba_state_conjunction * | current_conjunction () const =0 |
Get current conjunction of successor states. More... | |
virtual bdd | current_condition () const =0 |
Get the condition on the transition leading to this successor. More... | |
Iterate over the successors of a saba_state.
This class provides the basic functionalities required to iterate over the successors of a state of a saba. Since transitions of an alternating automaton are defined as a boolean function with conjunctions (universal) and disjunctions (non-deterministic),
|
pure virtual |
Get the condition on the transition leading to this successor.
This is a boolean function of atomic propositions.
|
pure virtual |
Get current conjunction of successor states.
|
pure virtual |
|
pure virtual |
Position the iterator on the first conjunction of successors (if any).
This method can be called several times to make multiple passes over successors.
|
pure virtual |
Jump to the next conjunction of successors (if any).
done()
to ensure there is a successor.