op_bisimulation.h
Go to the documentation of this file.
49 * of the coarsest quasi-congruence on the given generator by calling the function Bisimulation::partition.
64 void calcBisimulation(Generator& rGenOrig, std::map<Idx,Idx>& rMapStateToPartition, Generator& rGenPart, std::vector<Idx>& rNewPartitions);
69 * of the coarsest quasi-congruence on the given generator by calling the function Bisimulation::partition.
70 * See J.-C. Fernandez, “An implementation of an efficient algorithm for bisimulation equivalence,” Science of Computer Programming, vol. 13,
82 void calcBisimulation(Generator& rGenOrig, std::map<Idx,Idx>& rMapStateToPartition, std::vector<Idx>& rNewPartitions);
108 * Administration of the various steps of the computation of the coarsest quasi-congruence. An output
119 void partition(std::map<Idx,Idx>& rMapStateToPartition, Generator& rGenPart, std::vector<Idx>& rNewPartitions);
157 void computeInfoMaps(Partition& node, Partition* pSmallerPart, Partition* pLargerPart, EventSet::Iterator eIt);
libFAUDES 2.24g --- 2014.09.15 --- c++ api documentaion by doxygen |