op_bisimulation.h File Reference


Detailed Description

Methods to compute bisimulations on dynamic systems (represented by a finite automaton).

The relevant algorithms are described in J.-C. Fernandez, “An implementation of an efficient algorithm for bisimulation equivalence,” Science of Computer Programming, vol. 13, pp. 219-236, 1990. The class bisimulation supports these methods.

Definition in file op_bisimulation.h.

#include "libfaudes.h"
#include <vector>
#include <map>
#include "op_partition.h"
#include "op_debug.h"
#include <string>
#include <sstream>

Go to the source code of this file.

Namespaces

namespace  faudes
namespace  std

Classes

class  faudes::Bisimulation
 This class implements the algorithms needed for the computation of the coarsest quasi-congruence (=Bisimulation) of a given generator. More...

Defines

#define OP_BISIMULATION_H

Functions

void faudes::calcBisimulation (Generator &rGenOrig, map< Idx, Idx > &rMapStateToPartition, Generator &rGenPart, vector< Idx > &rNewPartitions)
 Computation of a bisimulation over a given generator.
void faudes::calcBisimulation (Generator &rGenOrig, map< Idx, Idx > &rMapStateToPartition, vector< Idx > &rNewPartitions)
 Computation of a bisimulation over a given generator.


Define Documentation

#define OP_BISIMULATION_H
 

Definition at line 241 of file op_bisimulation.h.


Generated on Fri May 9 11:26:47 2008 for libFAUDES 2.09b by  doxygen 1.4.4