spot
1.2.1a
|
This class allows to do a synchronized product between two fast tgba. More...
#include <fasttgba/fasttgba_product.hh>
Public Member Functions | |
fasttgba_product (const fasttgba *left, const fasttgba *right, bool left_is_kripke=false) | |
virtual fasttgba_state * | get_init_state () const |
Get the initial state of the automaton. More... | |
virtual fasttgba_succ_iterator * | succ_iter (const fasttgba_state *local_state) const |
Get an iterator over the successors of state. More... | |
virtual fasttgba_succ_iterator * | swarm_succ_iter (const fasttgba_state *local_state) const |
Get a Swarm iterator over the sucessors of a state. More... | |
virtual ap_dict & | get_dict () const |
Get the dictionary associated to the automaton. More... | |
virtual acc_dict & | get_acc () const |
Get the acceptance dictionary associated to the automaton. More... | |
virtual std::string | format_state (const fasttgba_state *state) const |
Format the state as a string for printing. More... | |
virtual std::string | transition_annotation (const fasttgba_succ_iterator *t) const |
Return a possible annotation for the transition pointed to by the iterator. More... | |
virtual fasttgba_state * | project_state (const fasttgba_state *s, const fasttgba *t) const |
Project a state on an automaton. More... | |
virtual markset | all_acceptance_marks () const |
Return the set of all acceptance marks used by this automaton. More... | |
virtual unsigned int | number_of_acceptance_marks () const |
The number of acceptance marks. More... | |
Protected Attributes | |
const fasttgba * | left_ |
The left aut. of the product. More... | |
const fasttgba * | right_ |
The right aut. of the product. More... | |
fixed_size_pool | pool_ |
bool | kripke_left |
The left automaton is a Kripke. More... | |
int | num_acc_ |
The number of acceptance mark. More... | |
int | num_var_ |
The number of variables. More... | |
This class allows to do a synchronized product between two fast tgba.
Warning : left and right must have the same atomic proposition dictionnary and the same acceptance dictionnary. This is not a restriction since the two FastTgba can share the same dictionnary even if they do not work with the same set of variables.
Remark : in order to do parallel emptiness checks, this product do not write in this two dicitonnaries
|
virtual |
Return the set of all acceptance marks used by this automaton.
The goal of the emptiness check is to ensure that a strongly connected component walks through each of these acceptance conditions. I.e., the union of the acceptance conditions of all transition in the SCC should be equal to the result of this function.
Implements spot::fasttgba.
|
virtual |
Format the state as a string for printing.
This formating is the responsability of the automata that owns the state.
Implements spot::fasttgba.
|
virtual |
Get the acceptance dictionary associated to the automaton.
Implements spot::fasttgba.
|
virtual |
Get the dictionary associated to the automaton.
Implements spot::fasttgba.
|
virtual |
Get the initial state of the automaton.
The state has been allocated with new
. It is the responsability of the caller to destroy
it when no longer needed.
Implements spot::fasttgba.
|
virtual |
The number of acceptance marks.
Implements spot::fasttgba.
|
virtual |
Project a state on an automaton.
Implements spot::fasttgba.
|
virtual |
Get an iterator over the successors of state.
state | The state whose successors are to be explored. This pointer is not adopted in any way by succ_iter , and it is still the caller's responsability to destroy it when appropriate (this can be done during the lifetime of the iterator). |
Implements spot::fasttgba.
|
virtual |
Get a Swarm iterator over the sucessors of a state.
Such an iterator visits randomly once each outgoing transitions
state | the states whose successors are to be explored. |
Implements spot::fasttgba.
|
virtual |
Return a possible annotation for the transition pointed to by the iterator.
Implements spot::fasttgba.
|
protected |
The left automaton is a Kripke.
|
protected |
The left aut. of the product.
|
mutableprotectedinherited |
The number of acceptance mark.
|
mutableprotectedinherited |
The number of variables.
|
protected |
The right aut. of the product.