Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members

spot::tgba_reduc Class Reference

#include <tgbareduc.hh>

Inheritance diagram for spot::tgba_reduc:

Inheritance graph
[legend]
Collaboration diagram for spot::tgba_reduc:

Collaboration graph
[legend]
List of all members.

Public Types

typedef std::list< transition * > state

Public Member Functions

 tgba_reduc (const tgba *a, const numbered_state_heap_factory *nshf=numbered_state_heap_hash_map_factory::instance())
 ~tgba_reduc ()
void prune_automata (simulation_relation *rel)
void quotient_state (simulation_relation *rel)
void prune_scc ()
 Remove all state which not lead to an accepting cycle.

void prune_acc ()
 Remove some useless accepting condition.

void compute_scc ()
 Compute the maximal SCC of the automata.

virtual std::string format_state (const spot::state *state) const
 Add the SCC index to the display of the state state.

int get_nb_state ()
 Obsolete.

int get_nb_transition ()
void display_rel_sim (simulation_relation *rel, std::ostream &os)
void display_scc (std::ostream &os)
void set_init_state (const std::string &state)
transition * create_transition (const std::string &source, const std::string &dest)
void add_condition (transition *t, const ltl::formula *f)
void add_conditions (transition *t, bdd f)
 This assumes that all variables in f are known from dict.

void declare_acceptance_condition (const ltl::formula *f)
bool has_acceptance_condition (const ltl::formula *f) const
void add_acceptance_condition (transition *t, const ltl::formula *f)
void add_acceptance_conditions (transition *t, bdd f)
 This assumes that all acceptance conditions in f are known from dict.

void complement_all_acceptance_conditions ()
void merge_transitions ()
virtual spot::stateget_init_state () const
 Get the initial state of the automaton.

virtual tgba_succ_iteratorsucc_iter (const spot::state *local_state, const spot::state *global_state=0, const tgba *global_automaton=0) const
virtual tgba_succ_iteratorsucc_iter (const state *local_state, const state *global_state=0, const tgba *global_automaton=0) const =0
 Get an iterator over the successors of local_state.

virtual bdd_dictget_dict () const
 Get the dictionary associated to the automaton.

virtual std::string format_state (const state *state) const =0
 Format the state as a string for printing.

virtual bdd all_acceptance_conditions () const
 Return the set of all acceptance conditions used by this automaton.

virtual bdd neg_acceptance_conditions () const
 Return the conjuction of all negated acceptance variables.

bdd support_conditions (const state *state) const
 Get a formula that must hold whatever successor is taken.

bdd support_variables (const state *state) const
 Get the conjunctions of variables tested by the outgoing transitions of state.

virtual stateproject_state (const state *s, const tgba *t) const
 Project a state on an automata.

virtual void add_state (const state *s)
virtual const statenext_state ()
 Called by run() to obtain the.

void run ()
 Iterate over all reachable states of a spot::tgba.

virtual void process_state (const state *s, int n, tgba_succ_iterator *si)

Protected Types

typedef Sgi::hash_map< const
tgba_explicit::state *, std::list<
state * > *, ptr_hash< tgba_explicit::state > > 
sp_map
typedef Sgi::hash_map< const
spot::state *, int, state_ptr_hash,
state_ptr_equal
seen_map
typedef Sgi::hash_map< const
std::string, tgba_explicit::state *,
string_hash
ns_map
typedef Sgi::hash_map< const
tgba_explicit::state *, std::string,
ptr_hash< tgba_explicit::state > > 
sn_map

Protected Member Functions

void start ()
 Called by run() before starting its iteration.

void end ()
 Called by run() once all states have been explored.

void process_state (const spot::state *s, int n, tgba_succ_iterator *si)
void process_link (int in, int out, const tgba_succ_iterator *si)
transition * create_transition (const spot::state *source, const spot::state *dest)
 Create a transition using two state of a TGBA.

void redirect_transition (const spot::state *s, const spot::state *simul)
void remove_predecessor_state (const state *s, const state *p)
 Remove p of the predecessor of s.

void remove_state (const spot::state *s)
void merge_state (const spot::state *s1, const spot::state *s2)
void delete_scc ()
bool is_alpha_ball (const spot::state *s, bdd label=bddfalse, int n=-1)
bool is_terminal (const spot::state *s, int n=-1)
bool is_not_accepting (const spot::state *s, int n=-1)
void remove_acc (const spot::state *s)
void remove_scc (spot::state *s)
 Remove all the state which belong to the same scc that s.

void remove_scc_depth_first (spot::state *s, int n=-1)
 Same as remove_scc but more efficient.

void remove_component (const spot::state *from)
 For compute_scc.

virtual bdd compute_support_conditions (const spot::state *state) const
virtual bdd compute_support_conditions (const state *state) const =0
 Do the actual computation of tgba::support_conditions().

virtual bdd compute_support_variables (const spot::state *state) const
virtual bdd compute_support_variables (const state *state) const =0
 Do the actual computation of tgba::support_variables().

stateadd_state (const std::string &name)
bdd get_acceptance_condition (const ltl::formula *f)

Protected Attributes

bool scc_computed_
scc_stack root_
numbered_state_heaph_
std::stack< const spot::state * > state_scc_
Sgi::hash_map< int, const
spot::state * > 
state_scc_v_
sp_map state_predecessor_map_
seen_map si_
seen_mapseen_
bdd acc_
ns_map name_state_map_
sn_map state_name_map_
bdd_dictdict_
tgba_explicit::stateinit_
bdd all_acceptance_conditions_
bdd neg_acceptance_conditions_
bool all_acceptance_conditions_computed_
std::deque< const state * > todo
 A queue of states yet to explore.

const tgbaautomata_
 The spot::tgba to explore.

seen_map seen
 States already seen.


Member Typedef Documentation

typedef Sgi::hash_map<const std::string, tgba_explicit::state*, string_hash> spot::tgba_explicit::ns_map [protected, inherited]
 

typedef Sgi::hash_map<const spot::state*, int, state_ptr_hash, state_ptr_equal> spot::tgba_reduc::seen_map [protected]
 

Reimplemented from spot::tgba_reachable_iterator.

typedef Sgi::hash_map<const tgba_explicit::state*, std::string, ptr_hash<tgba_explicit::state> > spot::tgba_explicit::sn_map [protected, inherited]
 

typedef Sgi::hash_map<const tgba_explicit::state*, std::list<state*>*, ptr_hash<tgba_explicit::state> > spot::tgba_reduc::sp_map [protected]
 

typedef std::list<transition*> spot::tgba_explicit::state [inherited]
 


Constructor & Destructor Documentation

spot::tgba_reduc::tgba_reduc const tgba a,
const numbered_state_heap_factory nshf = numbered_state_heap_hash_map_factory::instance()
 

spot::tgba_reduc::~tgba_reduc  ) 
 


Member Function Documentation

void spot::tgba_explicit::add_acceptance_condition transition t,
const ltl::formula f
[inherited]
 

void spot::tgba_explicit::add_acceptance_conditions transition t,
bdd  f
[inherited]
 

This assumes that all acceptance conditions in f are known from dict.

void spot::tgba_explicit::add_condition transition t,
const ltl::formula f
[inherited]
 

void spot::tgba_explicit::add_conditions transition t,
bdd  f
[inherited]
 

This assumes that all variables in f are known from dict.

virtual void spot::tgba_reachable_iterator_breadth_first::add_state const state s  )  [virtual, inherited]
 

Implements spot::tgba_reachable_iterator.

state* spot::tgba_explicit::add_state const std::string &  name  )  [protected, inherited]
 

virtual bdd spot::tgba_explicit::all_acceptance_conditions  )  const [virtual, inherited]
 

Return the set of all acceptance conditions used by this automaton.

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::tgba.

void spot::tgba_explicit::complement_all_acceptance_conditions  )  [inherited]
 

void spot::tgba_reduc::compute_scc  ) 
 

Compute the maximal SCC of the automata.

virtual bdd spot::tgba::compute_support_conditions const state state  )  const [protected, pure virtual, inherited]
 

Do the actual computation of tgba::support_conditions().

Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy.

virtual bdd spot::tgba_explicit::compute_support_conditions const spot::state state  )  const [protected, virtual, inherited]
 

virtual bdd spot::tgba::compute_support_variables const state state  )  const [protected, pure virtual, inherited]
 

Do the actual computation of tgba::support_variables().

Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy.

virtual bdd spot::tgba_explicit::compute_support_variables const spot::state state  )  const [protected, virtual, inherited]
 

transition* spot::tgba_explicit::create_transition const std::string &  source,
const std::string &  dest
[inherited]
 

transition* spot::tgba_reduc::create_transition const spot::state source,
const spot::state dest
[protected]
 

Create a transition using two state of a TGBA.

void spot::tgba_explicit::declare_acceptance_condition const ltl::formula f  )  [inherited]
 

void spot::tgba_reduc::delete_scc  )  [protected]
 

Remove all the scc which are terminal and doesn't contains all the acceptance conditions.

void spot::tgba_reduc::display_rel_sim simulation_relation rel,
std::ostream &  os
 

void spot::tgba_reduc::display_scc std::ostream &  os  ) 
 

void spot::tgba_reduc::end  )  [protected, virtual]
 

Called by run() once all states have been explored.

Reimplemented from spot::tgba_reachable_iterator.

virtual std::string spot::tgba::format_state const state state  )  const [pure virtual, inherited]
 

Format the state as a string for printing.

This formating is the responsability of the automata who owns the state.

Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy.

virtual std::string spot::tgba_reduc::format_state const spot::state state  )  const [virtual]
 

Add the SCC index to the display of the state state.

Reimplemented from spot::tgba_explicit.

bdd spot::tgba_explicit::get_acceptance_condition const ltl::formula f  )  [protected, inherited]
 

virtual bdd_dict* spot::tgba_explicit::get_dict  )  const [virtual, inherited]
 

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::tgba.

virtual spot::state* spot::tgba_explicit::get_init_state  )  const [virtual, inherited]
 

Get the initial state of the automaton.

The state has been allocated with new. It is the responsability of the caller to delete it when no longer needed.

Implements spot::tgba.

int spot::tgba_reduc::get_nb_state  ) 
 

Obsolete.

int spot::tgba_reduc::get_nb_transition  ) 
 

bool spot::tgba_explicit::has_acceptance_condition const ltl::formula f  )  const [inherited]
 

bool spot::tgba_reduc::is_alpha_ball const spot::state s,
bdd  label = bddfalse,
int  n = -1
[protected]
 

Return true if the scc which contains s is an fixed-formula alpha-ball. this is explain in

@InProceedings{ etessami.00.concur, author = {Kousha Etessami and Gerard J. Holzmann}, title = {Optimizing {B\"u}chi Automata}, booktitle = {Proceedings of the 11th International Conference on Concurrency Theory (Concur'2000)}, pages = {153--167}, year = {2000}, editor = {C. Palamidessi}, volume = {1877}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag} }

bool spot::tgba_reduc::is_not_accepting const spot::state s,
int  n = -1
[protected]
 

bool spot::tgba_reduc::is_terminal const spot::state s,
int  n = -1
[protected]
 

void spot::tgba_reduc::merge_state const spot::state s1,
const spot::state s2
[protected]
 

Redirect all transition leading to s1 to s2. Note that we can do the reverse because s1 and s2 belong to a co-simulate relation.

void spot::tgba_explicit::merge_transitions  )  [inherited]
 

virtual bdd spot::tgba_explicit::neg_acceptance_conditions  )  const [virtual, inherited]
 

Return the conjuction of all negated acceptance variables.

For instance if the automaton uses variables Acc[a], Acc[b] and Acc[c] to describe acceptance sets, this function should return !Acc[a]&!Acc[b]&!Acc[c].

This is useful when making products: each operand's condition set should be augmented with the neg_acceptance_conditions() of the other operand.

Implements spot::tgba.

virtual const state* spot::tgba_reachable_iterator_breadth_first::next_state  )  [virtual, inherited]
 

Called by run() to obtain the.

Implements spot::tgba_reachable_iterator.

void spot::tgba_reduc::process_link int  in,
int  out,
const tgba_succ_iterator si
[protected, virtual]
 

Called by run() to process a transition.

Parameters:
in The source state number.
out The destination state number.
si The spot::tgba_succ_iterator positionned on the current transition.

Reimplemented from spot::tgba_reachable_iterator.

virtual void spot::tgba_reachable_iterator::process_state const state s,
int  n,
tgba_succ_iterator si
[virtual, inherited]
 

Called by run() to process a state.

Parameters:
s The current state.
n An unique number assigned to s.
si The spot::tgba_succ_iterator for s.

Reimplemented in spot::parity_game_graph.

void spot::tgba_reduc::process_state const spot::state s,
int  n,
tgba_succ_iterator si
[protected]
 

virtual state* spot::tgba::project_state const state s,
const tgba t
const [virtual, inherited]
 

Project a state on an automata.

This converts s, into that corresponding spot::state for t. This is useful when you have the state of a product, and want restrict this state to a specific automata occuring in the product.

It goes without saying that s and t should be compatible (i.e., s is a state of t).

Returns:
0 if the projection fails (s is unrelated to t), or a new state* (the projected state) that must be deleted by the caller.

Reimplemented in spot::tgba_product, and spot::tgba_tba_proxy.

void spot::tgba_reduc::prune_acc  ) 
 

Remove some useless accepting condition.

void spot::tgba_reduc::prune_automata simulation_relation rel  ) 
 

Reduce the automata using a relation simulation Do not call this method with a delayed simulation relation.

void spot::tgba_reduc::prune_scc  ) 
 

Remove all state which not lead to an accepting cycle.

void spot::tgba_reduc::quotient_state simulation_relation rel  ) 
 

Build the quotient automata. Call this method when use to a delayed simulation relation.

void spot::tgba_reduc::redirect_transition const spot::state s,
const spot::state simul
[protected]
 

Remove all the transition from the state q, predecessor of both s and simul, which can be removed.

void spot::tgba_reduc::remove_acc const spot::state s  )  [protected]
 

If a scc maximal do not contains all the accepting condition we can remove all the accepting condition in this scc.

void spot::tgba_reduc::remove_component const spot::state from  )  [protected]
 

For compute_scc.

void spot::tgba_reduc::remove_predecessor_state const state s,
const state p
[protected]
 

Remove p of the predecessor of s.

void spot::tgba_reduc::remove_scc spot::state s  )  [protected]
 

Remove all the state which belong to the same scc that s.

void spot::tgba_reduc::remove_scc_depth_first spot::state s,
int  n = -1
[protected]
 

Same as remove_scc but more efficient.

void spot::tgba_reduc::remove_state const spot::state s  )  [protected]
 

Remove all the transition leading to s. s is then unreachable and can be consider as remove.

void spot::tgba_reachable_iterator::run  )  [inherited]
 

Iterate over all reachable states of a spot::tgba.

This is a template method that will call add_state(), next_state(), start(), end(), process_state(), and process_link(), while it iterate over state.

void spot::tgba_explicit::set_init_state const std::string &  state  )  [inherited]
 

void spot::tgba_reduc::start  )  [protected, virtual]
 

Called by run() before starting its iteration.

Reimplemented from spot::tgba_reachable_iterator.

virtual tgba_succ_iterator* spot::tgba::succ_iter const state local_state,
const state global_state = 0,
const tgba global_automaton = 0
const [pure virtual, inherited]
 

Get an iterator over the successors of local_state.

The iterator has been allocated with new. It is the responsability of the caller to delete it when no longer needed.

During synchornized products, additional informations are passed about the entire product and its state. Recall that products can be nested, forming a tree of spot::tgba where most values are computed on demand. global_automaton designate the root spot::tgba, and global_state its state. This two objects can be used by succ_iter() to restrict the set of successors to compute.

Parameters:
local_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 delete it when appropriate (this can be done during the lifetime of the iterator).
global_state In a product, the state of the global product automaton. Otherwise, 0. Like locale_state, global_state is not adopted by succ_iter.
global_automaton In a product, the global product automaton. Otherwise, 0.

Implemented in spot::tgba_bdd_concrete, spot::tgba_product, and spot::tgba_tba_proxy.

virtual tgba_succ_iterator* spot::tgba_explicit::succ_iter const spot::state local_state,
const spot::state global_state = 0,
const tgba global_automaton = 0
const [virtual, inherited]
 

bdd spot::tgba::support_conditions const state state  )  const [inherited]
 

Get a formula that must hold whatever successor is taken.

Returns:
A formula which must be verified for all successors of state.
This can be as simple as bddtrue, or more completely the disjunction of the condition of all successors. This is used as an hint by succ_iter() to reduce the number of successor to compute in a product.

Sub classes should implement compute_support_conditions(), this function is just a wrapper that will cache the last return value for efficiency.

bdd spot::tgba::support_variables const state state  )  const [inherited]
 

Get the conjunctions of variables tested by the outgoing transitions of state.

All variables tested by outgoing transitions must be returned. This is mandatory.

This is used as an hint by some succ_iter() to reduce the number of successor to compute in a product.

Sub classes should implement compute_support_variables(), this function is just a wrapper that will cache the last return value for efficiency.


Member Data Documentation

bdd spot::tgba_reduc::acc_ [protected]
 

bdd spot::tgba_explicit::all_acceptance_conditions_ [mutable, protected, inherited]
 

bool spot::tgba_explicit::all_acceptance_conditions_computed_ [mutable, protected, inherited]
 

const tgba* spot::tgba_reachable_iterator::automata_ [protected, inherited]
 

The spot::tgba to explore.

bdd_dict* spot::tgba_explicit::dict_ [protected, inherited]
 

numbered_state_heap* spot::tgba_reduc::h_ [protected]
 

tgba_explicit::state* spot::tgba_explicit::init_ [protected, inherited]
 

ns_map spot::tgba_explicit::name_state_map_ [protected, inherited]
 

bdd spot::tgba_explicit::neg_acceptance_conditions_ [protected, inherited]
 

scc_stack spot::tgba_reduc::root_ [protected]
 

bool spot::tgba_reduc::scc_computed_ [protected]
 

seen_map spot::tgba_reachable_iterator::seen [protected, inherited]
 

States already seen.

seen_map* spot::tgba_reduc::seen_ [protected]
 

seen_map spot::tgba_reduc::si_ [protected]
 

sn_map spot::tgba_explicit::state_name_map_ [protected, inherited]
 

sp_map spot::tgba_reduc::state_predecessor_map_ [protected]
 

std::stack<const spot::state*> spot::tgba_reduc::state_scc_ [protected]
 

Sgi::hash_map<int, const spot::state*> spot::tgba_reduc::state_scc_v_ [protected]
 

std::deque<const state*> spot::tgba_reachable_iterator_breadth_first::todo [protected, inherited]
 

A queue of states yet to explore.


The documentation for this class was generated from the following file:
Generated on Tue Jun 29 17:01:51 2004 for spot by doxygen 1.3.7