Package statechum.analysis.learning.rpnicore

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

157
158
159
160
161
162
163
164
165
166
167
          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
158
159
160
161
162
163
164
165
166
167
168
          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
160
161
162
163
164
165
166
167
168
169
170
        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
161
162
163
164
165
166
167
168
169
170
171
        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
162
163
164
165
166
167
168
169
170
171
172
        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
164
165
166
167
168
169
170
171
172
173
174
       
        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
165
166
167
168
169
170
171
172
173
174
175
        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
745
746
747
748
749
750
751
752
753
754
755
          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);
       
          for(Entry<CmpVertex,Map<Label,CmpVertex>> entry:graph.transitionMatrix.entrySet())
            if (!entry.getKey().equals(phantomVertex) && entry.getKey().getDepth() < 0)
              throw new IllegalArgumentException("no depth assigned to vertex "+entry.getKey());
View Full Code Here
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
            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
601
602
603
604
605
606
607
608
609
610
611
          Map<Label,CmpVertex> row = trimmedOne.transitionMatrix.get(target);
          if (row == null)
          {
            row = trimmedOne.createNewRow();trimmedOne.transitionMatrix.put(target, row);
          }
          trimmedOne.addTransition(currentRow, labelstate.getKey(), target);
         
          if (!statesInFringe.contains(target))
          {
            @SuppressWarnings("unchecked")
            LinkedList<Label> newPath = (LinkedList<Label>)currentPath.clone();newPath.add(labelstate.getKey());
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.