Package statechum.analysis.learning.rpnicore.WMethod

Examples of statechum.analysis.learning.rpnicore.WMethod.DifferentFSMException

1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
    {
      StatePair statePair = currentExplorationBoundary.remove();
      assert big.transitionMatrix.containsKey(statePair.firstElem) : "state "+statePair.firstElem+" is not known to the first graph";
      assert small.transitionMatrix.containsKey(statePair.secondElem) : "state "+statePair.secondElem+" is not known to the second graph";
      if (statePair.firstElem.isAccept() != statePair.secondElem.isAccept())
        throw new DifferentFSMException("states "+statePair.firstElem+" and " + statePair.secondElem+" have a different acceptance labelling between the machines");

      Map<Label,CmpVertex> targetsBig = big.transitionMatrix.get(statePair.firstElem);
      Map<Label,CmpVertex> targetsSmall = small.transitionMatrix.get(statePair.secondElem);
         
      for(Entry<Label,CmpVertex> labelstate:targetsSmall.entrySet())
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
      if (GlobalConfiguration.getConfiguration().isAssertEnabled())
      {
        // Cannot compare colours here because patches are structural,
        // hence where there are no new transitions, colours are retained rather
        // than changed to new ones.
        DifferentFSMException ex = WMethod.checkM(newGraph, graph);
        if (ex != null) throw ex;
        ex = WMethod.checkM(newGraph, whatShouldBeIdenticalToNewGraph);
        if (ex != null) throw ex;
        ex = WMethod.checkM_and_colours(newGraph, whatShouldBeIdenticalToNewGraph,VERTEX_COMPARISON_KIND.DEEP);
        if (ex != null) throw ex;
View Full Code Here
1347
1348
1349
1350
1351
1352
1353
1354
1355
        }
    }
   
    // the learning of the pairs experiment should always produce the correct outcome since decisions to merge pairs are guaranteed to be correct.
         LearnerGraph learntWithoutNegatives = new LearnerGraph(learnerInitConfiguration.config);AbstractPathRoutines.removeRejectStates(actualAutomaton,learntWithoutNegatives);
    DifferentFSMException diff = WMethod.checkM(referenceGraph, learntWithoutNegatives);if (diff != null) throw diff;
    System.out.println(new Date().toString()+" arff written");
    return actualAutomaton;
  }
View Full Code Here
605
606
607
608
609
610
611
612
613
    graph.config.setLearnerIdMode(Configuration.IDMode.POSITIVE_NEGATIVE);
    graph.paths.augmentPTA(minusStrings, false,true);

    final LearnerGraph expected = new LearnerGraph(Configuration.getDefaultConfiguration().copy());
    expected.getVertex(new LinkedList<String>()).setAccept(false);
    DifferentFSMException result = WMethod.checkM(expected,graph);
    Assert.assertNull(result);
    checkDepthLabelling(graph);
  }
View Full Code Here
391
392
393
394
395
396
397
398
399
400
      }
    }
   
    if (checkWasModified)
    {// if graphModified is true the graph should not have been modified and vice-versa
      DifferentFSMException ex = WMethod.checkM(graph, result);
      assert graphModified == (ex != null);
    }
    return graphModified?result:null;
  }
View Full Code Here
409
410
411
412
413
414
415
416
417
418
      }
    }
   
    if (GlobalConfiguration.getConfiguration().isAssertEnabled() && checkWasModified)
    {// if graphModified is true the graph should not have been modified and vice-versa
      DifferentFSMException ex = WMethod.checkM(graph, result);
      assert graphModified == (ex != null);
    }
    return graphModified?result:null;
  }
View Full Code Here
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
    {
      StatePair statePair = currentExplorationBoundary.remove();
      assert big.transitionMatrix.containsKey(statePair.firstElem) : "state "+statePair.firstElem+" is not known to the first graph";
      assert small.transitionMatrix.containsKey(statePair.secondElem) : "state "+statePair.secondElem+" is not known to the second graph";
      if (statePair.firstElem.isAccept() != statePair.secondElem.isAccept())
        throw new DifferentFSMException("states "+statePair.firstElem+" and " + statePair.secondElem+" have a different acceptance labelling between the machines");

      Map<Label,CmpVertex> targetsBig = big.transitionMatrix.get(statePair.firstElem);
      Map<Label,CmpVertex> targetsSmall = small.transitionMatrix.get(statePair.secondElem);
         
      for(Entry<Label,CmpVertex> labelstate:targetsSmall.entrySet())
View Full Code Here
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
    {
      // Checks that all states recorded as equivalent are indeed equivalent
      for(CmpVertex eA:eqStatesGroup.getStates())
        for(CmpVertex eB:eqStatesGroup.getStates())
        {
          DifferentFSMException exception = WMethod.checkM(fsm,eA,fsm,eB,WMethod.VERTEX_COMPARISON_KIND.NONE);
          Assert.assertNull("states "+eA+" and "+eB+" should belong to the same equivalence class, got "+(exception == null?"":exception.getMessage()),exception);
        }
      // Checks that all states in different equivalence classes are not equivalent.
      for(AMEquivalenceClass<CmpVertex,LearnerGraphCachedData> eqStatesGroupAnother:e.getEquivalentStates())
        if (eqStatesGroup != eqStatesGroupAnother)
        {
          for(CmpVertex eA:eqStatesGroup.getStates()) // our states
            for(CmpVertex eB:eqStatesGroupAnother.getStates()) // other states
            {
              DifferentFSMException exception = WMethod.checkM(fsm,eA,fsm,eB,WMethod.VERTEX_COMPARISON_KIND.NONE);
              if (exception == null)
              {// failure tracing
                fsm.config.setPrefixClosed(true);
                DifferentFSMException ex = WMethod.checkM(fsm,eA,fsm,eB,WMethod.VERTEX_COMPARISON_KIND.NONE);
                System.out.println("B: "+fsm.transitionMatrix.get(fsm.findVertex("B"))+" ; D:  "+fsm.transitionMatrix.get(fsm.findVertex("D")));
                System.out.println(ex);
                fsm.config.setPrefixClosed(false);
                DifferentFSMException ex2 = WMethod.checkM(fsm,eA,fsm,eB,WMethod.VERTEX_COMPARISON_KIND.NONE);
                System.out.println(ex2==null?"NULL":ex);
              }
              Assert.assertNotNull("states "+eA+" and "+eB+" should belong to different equivalence classes",exception);
            }
        }
View Full Code Here
1598
1599
1600
1601
1602
1603
1604
1605
    Configuration config = Configuration.getDefaultConfiguration();
    final LearnerGraph graph = new LearnerGraph(FsmParser.buildGraph("A-a->B-a->A\nB-c->C-(1 && (a || b))->C","testInterpretLabelsOnGraph3a"),config);
    final LearnerGraph expected = new LearnerGraph(FsmParser.buildGraph("A-a->B-a->A\nB-c->C-a->C-b->C","testInterpretLabelsOnGraph3b"),config);
    Set<String> alphabet = graph.pathroutines.computeAlphabet();alphabet.remove("1");alphabet.add("b");
    final LearnerGraph outcome = graph.transform.interpretLabelsOnGraph(alphabet);
    DifferentFSMException ex= WMethod.checkM_and_colours(expected, outcome, VERTEX_COMPARISON_KIND.DEEP);
    Assert.assertNull(ex==null?"":ex.toString(),ex);
  }
View Full Code Here
1613
1614
1615
1616
1617
1618
1619
1620
    Set<String> alphabet = new TreeSet<String>();alphabet.addAll(Arrays.asList(new String[]{"load","save","edit","close","exit"}));
    final LearnerGraph outcome = graph.transform.interpretLabelsOnGraph(alphabet);
    expected.addTransition(expected.transitionMatrix.get(expected.findVertex(VertexID.parseID("A"))), "to_R",expected.findVertex(VertexID.parseID("R")));
    outcome.addTransition(outcome.transitionMatrix.get(outcome.findVertex(VertexID.parseID("A"))), "to_R",outcome.findVertex(VertexID.parseID("R")));
    //Visualiser.updateFrame(PathRoutines.convertPairAssociationsToTransitions(expected,config), PathRoutines.convertPairAssociationsToTransitions(outcome,config));
    DifferentFSMException ex= WMethod.checkM_and_colours(expected, outcome, VERTEX_COMPARISON_KIND.NONE);
    Assert.assertNull(ex==null?"":ex.toString(),ex);
  }
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.rpnicore.WMethod.DifferentFSMException

  • statechum.analysis.Erlang.TestSynapseAuxiliaryFunctions
  • statechum.analysis.learning.experiments.PairSelection.TestLearnFromTracesUsingMarkov
  • statechum.analysis.learning.experiments.PairSelection.TestLearnFromTracesUsingMarkov$InconsistencyComputation
  • statechum.analysis.learning.experiments.PairSelection.TestMarkovLearner
  • statechum.analysis.learning.experiments.PairSelection.TestWekaPairClassifier
  • statechum.analysis.learning.experiments.PaperUAS
  • statechum.analysis.learning.experiments.TestPaperUAS
  • statechum.analysis.learning.experiments.TestPaperUAS_Large
  • statechum.analysis.learning.linear.TestGD_ExistingGraphs
  • statechum.analysis.learning.linear.TestGD_ExistingGraphsUsingTestSet
    • Copyright © 2018 www.massapicom. 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.