spot
1.2.4
|
A lazy product between a Testing automaton and a Kripke structure. (States are computed on the fly.) More...
#include <ta/taproduct.hh>
Public Types | |
typedef std::set< state *, state_ptr_less_than > | states_set_t |
Public Member Functions | |
ta_product (const ta *testing_automaton, const kripke *kripke_structure) | |
Constructor. More... | |
virtual const std::set< state *, state_ptr_less_than > | get_initial_states_set () const |
Get the initial states set of the automaton. More... | |
virtual ta_succ_iterator_product * | succ_iter (const spot::state *s) const |
Get an iterator over the successors of state. More... | |
virtual ta_succ_iterator_product * | succ_iter (const spot::state *s, bdd changeset) const |
Get an iterator over the successors of state filtred by the changeset on transitions. More... | |
virtual bdd_dict * | get_dict () const |
Get the dictionary associated to the automaton. More... | |
virtual std::string | format_state (const spot::state *s) const |
Format the state as a string for printing. More... | |
virtual bool | is_accepting_state (const spot::state *s) const |
Return true if s is a Buchi-accepting state, otherwise false. More... | |
virtual bool | is_livelock_accepting_state (const spot::state *s) const |
Return true if s is a livelock-accepting state , otherwise false. More... | |
virtual bool | is_initial_state (const spot::state *s) const |
Return true if s is an initial state, otherwise false. More... | |
virtual bool | is_hole_state_in_ta_component (const spot::state *s) const |
Return true if the state s has no succeseurs in the TA automaton (the TA component of the product automaton) More... | |
virtual bdd | get_state_condition (const spot::state *s) const |
Return a BDD condition that represents the valuation of atomic propositions in the state s. More... | |
virtual bdd | all_acceptance_conditions () const |
Return the set of all acceptance conditions used by this automaton (for Generalized form: Transition-based Generalized Testing Automata). More... | |
virtual void | free_state (const spot::state *s) const |
Release a state s. More... | |
const ta * | get_ta () const |
const kripke * | get_kripke () const |
virtual spot::state * | get_artificial_initial_state () const |
Get the artificial initial state set of the automaton. Return 0 if this artificial state is not implemented (in this case, use get_initial_states_set ) The aim of adding this state is to have an unique initial state. This artificial initial state have one transition to each real initial state, and this transition is labeled by the corresponding initial condition. (For more details, see the paper cited above) More... | |
A lazy product between a Testing automaton and a Kripke structure. (States are computed on the fly.)
Constructor.
testing_automaton | The TA component in the product. |
kripke_structure | The Kripke component in the product. |
|
virtual |
Return the set of all acceptance conditions used by this automaton (for Generalized form: Transition-based Generalized Testing Automata).
The goal of the emptiness check is to ensure that a strongly connected component walks through each of these acceptiong conditions. I.e., the union of the acceptiong conditions of all transition in the SCC should be equal to the result of this function.
Implements spot::ta.
|
virtual |
Format the state as a string for printing.
This formating is the responsability of the automata that owns the state.
Implements spot::ta.
|
virtual |
Release a state s.
Implements spot::ta.
|
inlinevirtualinherited |
Get the artificial initial state set of the automaton. Return 0 if this artificial state is not implemented (in this case, use get_initial_states_set
) The aim of adding this state is to have an unique initial state. This artificial initial state have one transition to each real initial state, and this transition is labeled by the corresponding initial condition. (For more details, see the paper cited above)
Reimplemented in spot::ta_explicit.
|
virtual |
Get the dictionary associated to the automaton.
State are represented as BDDs. The dictionary allows to map BDD variables back to formulae, and vice versa. This is useful when dealing with several automata (which may use the same BDD variable for different formula), or simply when printing.
Implements spot::ta.
|
virtual |
Get the initial states set of the automaton.
Implements spot::ta.
|
virtual |
Return a BDD condition that represents the valuation of atomic propositions in the state s.
Implements spot::ta.
|
virtual |
Return true if s is a Buchi-accepting state, otherwise false.
Implements spot::ta.
|
virtual |
Return true if the state s has no succeseurs in the TA automaton (the TA component of the product automaton)
|
virtual |
Return true if s is an initial state, otherwise false.
Implements spot::ta.
|
virtual |
Return true if s is a livelock-accepting state , otherwise false.
Implements spot::ta.
|
virtual |
Get an iterator over the successors of state.
The iterator has been allocated with new
. It is the responsability of the caller to delete
it when no longer needed.
Implements spot::ta.
|
virtual |
Get an iterator over the successors of state filtred by the changeset on transitions.
The iterator has been allocated with new
. It is the responsability of the caller to delete
it when no longer needed.
Implements spot::ta.