Public Member Functions | Protected Member Functions | Private Attributes

spot::tgba_safra_complement Class Reference
[TGBA on-the-fly algorithms]

Build a complemented automaton.It creates an automaton that recognizes the negated language of aut. More...

#include <tgba/tgbasafracomplement.hh>

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

List of all members.

Public Member Functions

 tgba_safra_complement (const tgba *a)
virtual ~tgba_safra_complement ()
virtual stateget_init_state () const
 Get the initial state of the automaton.
virtual tgba_succ_iteratorsucc_iter (const state *local_state, const state *global_state=0, const tgba *global_automaton=0) const
 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
 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.
void * get_safra () const
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 std::string transition_annotation (const tgba_succ_iterator *t) const
 Return a possible annotation for the transition pointed to by the iterator.
virtual stateproject_state (const state *s, const tgba *t) const
 Project a state on an automaton.
virtual unsigned int number_of_acceptance_conditions () const
 The number of acceptance conditions.

Protected Member Functions

virtual bdd compute_support_conditions (const state *state) const
 Do the actual computation of tgba::support_conditions().
virtual bdd compute_support_variables (const state *state) const
 Do the actual computation of tgba::support_variables().

Private Attributes

const tgbaautomaton_
void * safra_
bdd all_acceptance_cond_
bdd neg_acceptance_cond_
std::vector< int > acceptance_cond_vec_

Detailed Description

Build a complemented automaton.

It creates an automaton that recognizes the negated language of aut.

1. First Safra construction algorithm produces a deterministic Rabin automaton. 2. Interpreting this deterministic Rabin automaton as a deterministic Streett will produce a complemented automaton. 3. Then we use a transformation from deterministic Streett automaton to nondeterministic Büchi automaton.

Safra construction is done in tgba_complement, the transformation is done on-the-fly when successors are called.

See also:
safra_determinisation, tgba_safra_complement::succ_iter.

Constructor & Destructor Documentation

spot::tgba_safra_complement::tgba_safra_complement ( const tgba a  ) 
virtual spot::tgba_safra_complement::~tgba_safra_complement (  )  [virtual]

Member Function Documentation

virtual bdd spot::tgba_safra_complement::all_acceptance_conditions (  )  const [virtual]

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.

virtual bdd spot::tgba_safra_complement::compute_support_conditions ( const state state  )  const [protected, virtual]

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

Implements spot::tgba.

virtual bdd spot::tgba_safra_complement::compute_support_variables ( const state state  )  const [protected, virtual]

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

Implements spot::tgba.

virtual std::string spot::tgba_safra_complement::format_state ( const state state  )  const [virtual]

Format the state as a string for printing.

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

Implements spot::tgba.

virtual bdd_dict* spot::tgba_safra_complement::get_dict (  )  const [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::tgba.

virtual state* spot::tgba_safra_complement::get_init_state (  )  const [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::tgba.

void* spot::tgba_safra_complement::get_safra (  )  const [inline]

References safra_.

virtual bdd spot::tgba_safra_complement::neg_acceptance_conditions (  )  const [virtual]

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 unsigned int spot::tgba::number_of_acceptance_conditions (  )  const [virtual, inherited]

The number of acceptance conditions.

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

Project a state on an automaton.

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 destroyed by the caller.

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

virtual tgba_succ_iterator* spot::tgba_safra_complement::succ_iter ( const state local_state,
const state global_state = 0,
const tgba global_automaton = 0 
) const [virtual]

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 destroy 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.

Implements spot::tgba.

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.

virtual std::string spot::tgba::transition_annotation ( const tgba_succ_iterator t  )  const [virtual, inherited]

Return a possible annotation for the transition pointed to by the iterator.

Implementing this function is optional; the default annotation it the empty string.

Parameters:
t a non-done tgba_succ_iterator for this automata

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


Member Data Documentation

Referenced by get_safra().


The documentation for this class was generated from the following file:

Please comment this page and report errors about it on the RefDocComments page.
Generated on Tue Feb 1 2011 12:00:54 for spot by doxygen 1.7.1