#include <op_bisimulation.h>
Definition at line 90 of file op_bisimulation.h.
Public Member Functions | |
Bisimulation (Generator &g) | |
Contructor. | |
void | writeW (void) |
Write W-tree to console. | |
void | partition (map< Idx, Idx > &rMapStateToPartition, Generator &rGenPart, vector< Idx > &rNewPartitions) |
Administration of the various steps of the computation of the coarsest quasi-congruence. | |
void | partition (map< Idx, Idx > &rMapStateToPartition, vector< Idx > &rNewPartitions) |
Administration of the various steps of the computation of the coarsest quasi-congruence. | |
void | writeRo (void) |
Write the current set of equivalence classes to console. | |
Private Member Functions | |
void | computeInfoMaps (Partition &node, Partition *pSmallerPart, Partition *pLargerPart, EventSet::Iterator eIt) |
Compute info-maps for two cosets P1 and P2. | |
void | computeInfoMap (Partition &B, Partition &Bstates, EventSet::Iterator eIt, StateSet &tb) |
Compute info-maps for coset B. | |
bool | stateLeadsToPartition (Idx state, Partition &node, EventSet::Iterator eIt) |
Check if a state has a eIt-transition into a coset denoted as node. | |
void | partitionClass (Partition &B) |
Refine current partition with respect to partition B. | |
void | partitionSplitter (Partition &B) |
Refine current partition with respect to partition B and make use of the fact that the current partition is stable with respect to the parent coset of B. | |
void | writeNode (Partition &node) |
Function needed for recursively plotting the W-tree to console. | |
Private Attributes | |
Generator * | gen |
Original Automaton. | |
map< Idx, Partition > | W |
W-tree. | |
Idx | index |
Counter to assign unique indices to the cosets. | |
vector< Partition * > | ro |
Contains the cosets of the current partition. | |
TransSetEvX2X1 | tset_evx2x1 |
TransSet of original generator sorted by EvX2X1. | |
set< Partition * > | roDividers |
Holds the cosets that can possibly split cosets in ro. |
|
Contructor.
Definition at line 67 of file op_bisimulation.cpp. |
|
Compute info-maps for coset B.
Definition at line 741 of file op_bisimulation.cpp. |
|
Compute info-maps for two cosets P1 and P2. The current partition is stable with respect to their parent coset P.
Definition at line 500 of file op_bisimulation.cpp. |
|
Administration of the various steps of the computation of the coarsest quasi-congruence.
Definition at line 927 of file op_bisimulation.cpp. |
|
Administration of the various steps of the computation of the coarsest quasi-congruence. An output generator that represents the resulting quotient automaton is also provided.
Definition at line 796 of file op_bisimulation.cpp. |
|
Refine current partition with respect to partition B.
Definition at line 581 of file op_bisimulation.cpp. |
|
Refine current partition with respect to partition B and make use of the fact that the current partition is stable with respect to the parent coset of B.
Definition at line 97 of file op_bisimulation.cpp. |
|
Check if a state has a eIt-transition into a coset denoted as node.
Definition at line 555 of file op_bisimulation.cpp. |
|
Function needed for recursively plotting the W-tree to console. For debugging purpose
Definition at line 1009 of file op_bisimulation.cpp. |
|
Write the current set of equivalence classes to console.
Definition at line 1039 of file op_bisimulation.cpp. |
|
Write W-tree to console.
Definition at line 1001 of file op_bisimulation.cpp. |
|
Original Automaton.
Definition at line 143 of file op_bisimulation.h. |
|
Counter to assign unique indices to the cosets.
Definition at line 194 of file op_bisimulation.h. |
|
Contains the cosets of the current partition.
Definition at line 199 of file op_bisimulation.h. |
|
Holds the cosets that can possibly split cosets in ro.
Definition at line 236 of file op_bisimulation.h. |
|
TransSet of original generator sorted by EvX2X1.
Definition at line 204 of file op_bisimulation.h. |
|
W-tree. Contains all cosets ever created Definition at line 189 of file op_bisimulation.h. |