Package statechum.analysis.learning.rpnicore

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

329
330
331
332
333
334
335
336
337
338
339
        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
330
331
332
333
334
335
336
337
338
339
340
          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
331
332
333
334
335
336
337
338
339
340
341
          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
332
333
334
335
336
337
338
339
340
341
342
          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
334
335
336
337
338
339
340
341
342
343
344
        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
335
336
337
338
339
340
341
342
343
344
345
        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
336
337
338
339
340
341
342
343
344
345
346
        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
338
339
340
341
342
343
344
345
346
347
348
       
        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
339
340
341
342
343
344
345
346
347
348
349
        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));
            }
        };
        createLogFileFromExistingLog("earlier_failure.txt");
View Full Code Here
948
949
950
951
952
953
954
955
956
957
958
          {
            if (alphabet != null)
            {// Create a state to ensure that the entire alphabet is visible when if-then automata are loaded.
              CmpVertex dummyState = AbstractLearnerGraph.generateNewCmpVertex(graph.nextID(true), bfLearnerInitConfiguration.config);
              Map<Label,CmpVertex> row = graph.createNewRow();
              for(Label lbl:alphabet.keySet()) graph.addTransition(row, lbl, dummyState);
              graph.transitionMatrix.put(dummyState, row);
            }
          }
          return graph;
        }
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.