spot  1.2.1a
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Classes | Public Member Functions | Protected Types | Protected Member Functions | Protected Attributes | List of all members
spot::dijkstra_scc Class Reference

#include <fasttgbaalgos/ec/dijkstra_scc.hh>

Inheritance diagram for spot::dijkstra_scc:
Inheritance graph
Collaboration diagram for spot::dijkstra_scc:
Collaboration graph

Classes

struct  pair_state_iter
 

Public Member Functions

 dijkstra_scc (instanciator *i, std::string option="")
 A constructor taking the automaton to check. More...
 
virtual ~dijkstra_scc ()
 A destructor. More...
 
bool check ()
 The implementation of the interface. More...
 
std::string extra_info_csv ()
 Get extra informations. More...
 

Protected Types

enum  color { Alive, Dead, Unknown }
 The color for a new State. More...
 
typedef Sgi::hash_map< const
fasttgba_state *, int,
fasttgba_state_ptr_hash,
fasttgba_state_ptr_equal
seen_map
 the storage More...
 

Protected Member Functions

void init ()
 Fix set ups for the algo. More...
 
virtual void dfs_push (fasttgba_state *)
 Push a new state to explore. More...
 
virtual void dfs_pop ()
 Pop states already explored. More...
 
virtual bool merge (fasttgba_state *)
 merge multiple states More...
 
virtual void main ()
 the main procedure More...
 
color get_color (const fasttgba_state *)
 Storage for counterexample found or not. More...
 

Protected Attributes

bool counterexample_found
 the automaton that will be used for the Emptiness check More...
 
const fasttgbaa_
 
std::vector< pair_state_itertodo
 the todo stack More...
 
std::vector< const
spot::fasttgba_state * > 
live
 
stack_of_rootsroots_stack_
 Root of stack. More...
 
deadstoredeadstore_
 The store of dead states. More...
 
seen_map H
 
const instance_automatoninst
 The instance automaton. More...
 
marksetempty_
 
unsigned int max_live_size_
 keep peack size More...
 
unsigned int max_dfs_size_
 keep peack size More...
 
int update_cpt_
 count UPDATE calls More...
 
int update_loop_cpt_
 count UPDATE loop iterations More...
 
int roots_poped_cpt_
 count UPDATE loop iterations More...
 
int states_cpt_
 count states More...
 
int transitions_cpt_
 count transitions More...
 
int memory_cost_
 evaluates memory More...
 
int trivial_scc_
 count trivial SCCs More...
 

Detailed Description

This class provides the adaptation of the emptiness check of couvreur using an Union Find structure and a specific dedicated root stack

Member Typedef Documentation

the storage

Member Enumeration Documentation

enum spot::dijkstra_scc::color
protected

The color for a new State.

Constructor & Destructor Documentation

spot::dijkstra_scc::dijkstra_scc ( instanciator i,
std::string  option = "" 
)

A constructor taking the automaton to check.

virtual spot::dijkstra_scc::~dijkstra_scc ( )
virtual

A destructor.

Member Function Documentation

bool spot::dijkstra_scc::check ( )
virtual

The implementation of the interface.

Implements spot::ec.

virtual void spot::dijkstra_scc::dfs_pop ( )
protectedvirtual

Pop states already explored.

virtual void spot::dijkstra_scc::dfs_push ( fasttgba_state )
protectedvirtual

Push a new state to explore.

std::string spot::dijkstra_scc::extra_info_csv ( )

Get extra informations.

color spot::dijkstra_scc::get_color ( const fasttgba_state )
protected

Storage for counterexample found or not.

void spot::dijkstra_scc::init ( )
inlineprotected

Fix set ups for the algo.

virtual void spot::dijkstra_scc::main ( )
protectedvirtual

the main procedure

virtual bool spot::dijkstra_scc::merge ( fasttgba_state )
protectedvirtual

merge multiple states

Member Data Documentation

bool spot::dijkstra_scc::counterexample_found
protected

the automaton that will be used for the Emptiness check

deadstore* spot::dijkstra_scc::deadstore_
protected

The store of dead states.

const instance_automaton* spot::dijkstra_scc::inst
protected

The instance automaton.

unsigned int spot::dijkstra_scc::max_dfs_size_
protected

keep peack size

unsigned int spot::dijkstra_scc::max_live_size_
protected

keep peack size

int spot::dijkstra_scc::memory_cost_
protected

evaluates memory

int spot::dijkstra_scc::roots_poped_cpt_
protected

count UPDATE loop iterations

stack_of_roots* spot::dijkstra_scc::roots_stack_
protected

Root of stack.

int spot::dijkstra_scc::states_cpt_
protected

count states

std::vector<pair_state_iter> spot::dijkstra_scc::todo
protected

the todo stack

int spot::dijkstra_scc::transitions_cpt_
protected

count transitions

int spot::dijkstra_scc::trivial_scc_
protected

count trivial SCCs

int spot::dijkstra_scc::update_cpt_
protected

count UPDATE calls

int spot::dijkstra_scc::update_loop_cpt_
protected

count UPDATE loop iterations


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

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Tue Jan 21 2014 16:52:02 for spot by doxygen 1.8.5