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.
#include "corefaudes.h"
#include "op_partition.h"
#include "op_debug.h"
#include <vector>
#include <map>
#include <string>
#include <sstream>
|
Namespaces |
namespace | faudes |
Classes |
class | faudes::Bisimulation |
| This class implements the algorithms needed for the computation of the coarsest quasi-congruence (=Bisimulation) of a given generator. More...
|
Functions |
void | faudes::calcBisimulation (Generator &rGenOrig, std::map< Idx, Idx > &rMapStateToPartition, Generator &rGenPart, std::vector< Idx > &rNewPartitions) |
| Computation of a bisimulation over a given generator.
|
void | faudes::calcBisimulation (Generator &rGenOrig, std::map< Idx, Idx > &rMapStateToPartition, std::vector< Idx > &rNewPartitions) |
| Computation of a bisimulation over a given generator.
|