process_decomposition_t Class Reference

#include <process_decomposition.hh>

Inheritance diagram for process_decomposition_t:

dve_process_decomposition_t

List of all members.

Public Member Functions

virtual int get_process_scc_id (state_t &)=0
virtual int get_process_scc_type (state_t &)=0
virtual int get_scc_count ()=0
virtual int get_scc_type (int)=0
virtual int get_scc_type_for_gid (int)=0
virtual bool is_weak ()=0
virtual void parse_process (std::size_t)=0


Detailed Description

This class is used to decompose a graph of a single process specified in a dve file into SCCs. The decomposition is not accesible directly but with member functions returning for a given state SCC id and type.

Member Function Documentation

virtual int get_process_scc_id ( state_t  )  [pure virtual]

Returns id of an SCC that the given local state of the process belongs to.

Implemented in dve_process_decomposition_t.

virtual int get_process_scc_type ( state_t  )  [pure virtual]

Returns type of an SCC that the given local state belongs to. Returned values: 0 means nonaccepting component, 1 means partially accepting component, and 2 means fully accepting component.

Implemented in dve_process_decomposition_t.

virtual int get_scc_count (  )  [pure virtual]

Returns the number of SCCs in the decomposition.

Implemented in dve_process_decomposition_t.

virtual int get_scc_type ( int   )  [pure virtual]

Returns type of the given SCC, where 0 means nonaccepting component, 1 means partially accepting component, and 2 means fully accepting component.

Implemented in dve_process_decomposition_t.

virtual bool is_weak (  )  [pure virtual]

Returns whether the process has a weak graph.

Implemented in dve_process_decomposition_t.

virtual void parse_process ( std::size_t   )  [pure virtual]

Performs the decomposition of a process with a given (global) id.

Implemented in dve_process_decomposition_t.

Referenced by dve_explicit_system_t::read().


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

Reference Manual for Library, 2006 developed in ParaDiSe laboratory, Faculty of Informatics, Masaryk University