Package statechum.analysis.learning.rpnicore

Examples of statechum.analysis.learning.rpnicore.LearnerGraph.addTransition()

146
147
148
149
150
151
152
153
154
155
156
          P1001 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit})),
          P1003 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit,lblLock})),
          reject = expectedGraph.getVertex(Arrays.asList(new Label[]{lblLock}));
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblWrite,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblCast,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
          P1003 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit,lblLock})),
          reject = expectedGraph.getVertex(Arrays.asList(new Label[]{lblLock}));
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblWrite,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblCast,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
       
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblWrite,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblCast,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblCast,P1003);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblLock,reject);
View Full Code Here
150
151
152
153
154
155
156
157
158
159
160
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblCast,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblCast,P1003);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblLock,reject);
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblCast,P1003);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblLock,reject);

        Assert.assertNull(WMethod.checkM_and_colours(expectedGraph,outcome,WMethod.VERTEX_COMPARISON_KIND.NONE));
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblCast,P1003);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblLock,reject);

        Assert.assertNull(WMethod.checkM_and_colours(expectedGraph,outcome,WMethod.VERTEX_COMPARISON_KIND.NONE));
            }
        };
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblCast,P1003);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1003),lblLock,reject);

        Assert.assertNull(WMethod.checkM_and_colours(expectedGraph,outcome,WMethod.VERTEX_COMPARISON_KIND.NONE));
            }
        };
        tool.loadConfig("resources/earlier_failure.txt");
View Full Code Here
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
            Set<Label> alphabet = graph.pathroutines.computeAlphabet();
            // Create a state to ensure that the entire alphabet is visible when if-then automata are loaded.
            phantomVertex = graph.nextID(true);
            CmpVertex dummyState = AbstractLearnerGraph.generateNewCmpVertex(phantomVertex, bfLearnerInitConfiguration.config);
            Map<Label,CmpVertex> row = graph.createNewRow();
            for(Label lbl:alphabet) graph.addTransition(row, lbl, dummyState);
            graph.transitionMatrix.put(dummyState, row);
          }
          return graph;
        }
      };
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
        CmpVertex
          init = expectedGraph.getInit(),
          P1001 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit})),
          P1003 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit,lblLock})),
          reject = expectedGraph.getVertex(Arrays.asList(new Label[]{lblLock}));
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblWrite,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblCast,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
View Full Code Here
156
157
158
159
160
161
162
163
164
165
166
          init = expectedGraph.getInit(),
          P1001 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit})),
          P1003 = expectedGraph.getVertex(Arrays.asList(new Label[]{lblInit,lblLock})),
          reject = expectedGraph.getVertex(Arrays.asList(new Label[]{lblLock}));
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblWrite,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblCast,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblRead,reject);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(init),lblUnlock,reject);
       
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblCast,P1001);
        expectedGraph.addTransition(expectedGraph.transitionMatrix.get(P1001),lblInit,reject);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.