1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
/*
* SPDX-FileCopyrightText: 2023 The Refinery Authors <https://refinery.tools/>
*
* SPDX-License-Identifier: EPL-2.0
*/
package tools.refinery.store.statecoding.stateequivalence;
import org.eclipse.collections.api.factory.primitive.IntIntMaps;
import org.eclipse.collections.api.map.primitive.IntIntMap;
import org.eclipse.collections.api.set.primitive.IntSet;
import org.eclipse.collections.impl.map.mutable.primitive.IntIntHashMap;
import org.eclipse.collections.impl.map.mutable.primitive.LongObjectHashMap;
import org.eclipse.collections.impl.set.mutable.primitive.IntHashSet;
import tools.refinery.store.model.Interpretation;
import tools.refinery.store.statecoding.Morphism;
import tools.refinery.store.statecoding.ObjectCode;
import tools.refinery.store.statecoding.StateEquivalenceChecker;
import tools.refinery.store.tuple.Tuple;
import java.util.ArrayList;
import java.util.List;
import java.util.Objects;
public class StateEquivalenceCheckerImpl implements StateEquivalenceChecker {
public static final int LIMIT = 1000;
@Override
public EquivalenceResult constructMorphism(IntSet individuals,
List<? extends Interpretation<?>> interpretations1,
ObjectCode code1,
List<? extends Interpretation<?>> interpretations2,
ObjectCode code2)
{
IntIntHashMap object2PermutationGroup = new IntIntHashMap();
List<List<IntIntMap>> permutationsGroups = new ArrayList<>();
final EquivalenceResult permutations = constructPermutationNavigation(individuals,
indexByHash(code1, individuals), indexByHash(code2, individuals),
object2PermutationGroup, permutationsGroups);
if (permutations == EquivalenceResult.DIFFERENT) {
return EquivalenceResult.DIFFERENT;
}
boolean hasNext;
PermutationMorphism morphism = new PermutationMorphism(object2PermutationGroup, permutationsGroups);
int tried = 0;
do {
if (testMorphism(interpretations1, interpretations2, morphism)) {
return permutations;
}
if(tried >= LIMIT) {
return EquivalenceResult.UNKNOWN;
}
hasNext = morphism.next();
tried++;
} while (hasNext);
if(permutations == EquivalenceResult.UNKNOWN) {
return EquivalenceResult.UNKNOWN;
} else {
return EquivalenceResult.DIFFERENT;
}
}
private LongObjectHashMap<IntHashSet> indexByHash(ObjectCode code, IntSet individuals) {
LongObjectHashMap<IntHashSet> result = new LongObjectHashMap<>();
for (int o = 0; o < code.getSize(); o++) {
if(! individuals.contains(o)){
long hash = code.get(o);
if(hash != 0) {
var equivalenceClass = result.get(hash);
if (equivalenceClass == null) {
equivalenceClass = new IntHashSet();
result.put(hash, equivalenceClass);
}
equivalenceClass.add(o);
}
}
}
return result;
}
private EquivalenceResult constructPermutationNavigation(IntSet individuals,
LongObjectHashMap<IntHashSet> map1,
LongObjectHashMap<IntHashSet> map2,
IntIntHashMap object2OptionIndex,
List<List<IntIntMap>> listOfOptions) {
if (map1.size() != map2.size()) {
return EquivalenceResult.DIFFERENT;
}
var iterator = map1.keySet().longIterator();
boolean allComplete = true;
while (iterator.hasNext()) {
long hash = iterator.next();
var set1 = map1.get(hash);
var set2 = map2.get(hash);
if (set2 == null) {
return EquivalenceResult.DIFFERENT;
}
var pairing = NodePairing.constructNodePairing(set1, set2);
if (pairing == null) {
return EquivalenceResult.DIFFERENT;
}
allComplete &= pairing.isComplete();
final int optionIndex = listOfOptions.size();
set1.forEach(key -> object2OptionIndex.put(key, optionIndex));
listOfOptions.add(pairing.permutations());
}
individuals.forEach(o -> listOfOptions.add(o,List.of(IntIntMaps.immutable.of(o,o))));
if(allComplete) {
return EquivalenceResult.ISOMORPHIC;
} else {
return EquivalenceResult.UNKNOWN;
}
}
private boolean testMorphism(List<? extends Interpretation<?>> s, List<? extends Interpretation<?>> t, Morphism m) {
for (int interpretationIndex = 0; interpretationIndex < s.size(); interpretationIndex++) {
var sI = s.get(interpretationIndex);
var tI = t.get(interpretationIndex);
var cursor = sI.getAll();
while (cursor.move()) {
final Tuple sTuple = cursor.getKey();
final Object sValue = cursor.getValue();
final Tuple tTuple = apply(sTuple, m);
final Object tValue = tI.get(tTuple);
if (!Objects.equals(sValue, tValue)) {
return false;
}
}
}
return true;
}
private Tuple apply(Tuple t, Morphism m) {
final int arity = t.getSize();
if (arity == 0) {
return Tuple.of();
} else if (arity == 1) {
return Tuple.of(m.get(t.get(0)));
} else if (arity == 2) {
return Tuple.of(m.get(t.get(0)), m.get(t.get(1)));
} else {
int[] newTupleIndices = new int[arity];
for (int i = 0; i < arity; i++) {
newTupleIndices[i] = m.get(t.get(i));
}
return Tuple.of(newTupleIndices);
}
}
}
|
