libFAUDES

Sections

Index

faudes::Partition Struct Reference

#include <op_partition.h>

List of all members.


Detailed Description

This struct implements a coset (=equivalence class) as needed for the computation of the coarsest quasi-congruence on an automaton.

Public Member Functions

 Partition ()
 Constructor.
void writeInfoMap (Idx event) const
 Write info-map to console.

Public Attributes

Idx index
 Unique index.
StateSet states
 Pointer to the associated StateSet.
PartitionpFather
 Index of the parent coset.
PartitionpBrother
 Index of the brother coset.
PartitionpFirstChild
 Index of first child coset.
PartitionpSecondChild
 Index of second child coset.
bool nonSplitting
 indicates if the current partition is stable with respect to this coset
std::map< Idx, std::map< Idx,
Idx > > 
infoMap
 Info-map.
Idx numberOfStates
 number of states in this coset

Constructor & Destructor Documentation

faudes::Partition::Partition (  ) 

Constructor.


Member Function Documentation

void faudes::Partition::writeInfoMap ( Idx  event  )  const

Write info-map to console.

Parameters:
event event for which the info-map shall be plotted


Member Data Documentation

Pointer to the associated StateSet.

Index of the parent coset.

Index of the brother coset.

Index of first child coset.

Index of second child coset.

indicates if the current partition is stable with respect to this coset

std::map<Idx,std::map<Idx,Idx> > faudes::Partition::infoMap

Info-map.

First Idx: event, second Idx: state, third Idx: number of occurences

number of states in this coset


The documentation for this struct was generated from the following files:

libFAUDES 2.13a c++ source docu by doxygen 1.5.6