Package statechum.analysis.learning.rpnicore.WMethod

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

105
106
107
108
109
110
111
112
113
114
115
116
117
118
  /** Verifies the equivalence of a supplied graph to the supplied machine. */
  public static void checkM_ND(String fsm,String g,Configuration conf, ConvertALabel converter)
  {
    final LearnerGraphND graph = buildLearnerGraphND(g,"expected graph",conf,converter);
    final LearnerGraphND expected = buildLearnerGraphND(fsm,"expected graph",conf,converter);
    DifferentFSMException
      ex1 = WMethod.checkM(expected,graph),
      ex2 = WMethod.checkM(graph,expected);
    if (ex1 != null)
      Assert.assertNotNull(ex2);
    else
      Assert.assertNull(ex2);
    Assert.assertNull(ex1==null?"":ex1.toString(),ex1);
  }
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
   */
  public static void checkM(String fsm,LearnerGraph graph,Configuration conf, ConvertALabel converter)
  {
    final LearnerGraph expected = buildLearnerGraph(fsm,"expected graph",conf,converter);
   
    DifferentFSMException
      ex1 = WMethod.checkM(expected,graph),
      ex2 = WMethod.checkM(graph,expected);
   
    if (ex1 != null)
      Assert.assertNotNull(ex2);
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
  public static void checkReduction(String fsm,String g,Configuration conf, ConvertALabel converter)
  {
    final LearnerGraph graph = buildLearnerGraph(g,"actual graph",conf,converter);
    final LearnerGraph expected = buildLearnerGraph(fsm,"expected graph",conf,converter);
   
    DifferentFSMException
      exReduction = WMethod.checkReduction(expected, expected.init, graph, graph.init);
   
    if (exReduction != null)
    {// if not a reduction, cannot be an equivalence
      DifferentFSMException
        ex1 = WMethod.checkM(expected,graph),
        ex2 = WMethod.checkM(graph,expected);
      Assert.assertNotNull(ex1);
      Assert.assertNotNull(ex2);
    }
View Full Code Here
69
70
71
72
73
74
75
76
77
78
    for(Entry<CmpVertex,LinkedList<String>> entry:A.wmethod.computeShortPathsToAllStates().entrySet())
    {
      CmpVertex Bstate = B.getVertex(entry.getValue());
      CmpVertex Astate = entry.getKey();
      if (Bstate.getColour() != Astate.getColour())
        throw new DifferentFSMException("states "+ Astate + " (" +
            ((Astate.getColour() == null)?"no color":Astate.getColour())+") and "+Bstate+" ("+
            ((Bstate.getColour() == null)?"no color":Bstate.getColour())+") have different colours");
    }  
  }
View Full Code Here
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
   
    System.out.println("Huge: "+hugeGraph.getStateNumber()+" states, "+(hugeGraph.getStateNumber()-hugeGraph.getAcceptStateNumber())+" reject states");
    System.out.println("Small: "+smallGraph.getStateNumber()+" states, "+(smallGraph.getStateNumber()-smallGraph.getAcceptStateNumber())+" reject states");
    Label labelToMerge = AbstractLearnerGraph.generateNewLabel("Waypoint_Selected",mainConfiguration,converter);
    LearnerGraph mergedHuge = PairQualityLearner.mergeStatesForUnique(hugeGraph, labelToMerge);
    DifferentFSMException diffFSM = WMethod.checkM(smallGraph, mergedHuge);
    if (diffFSM != null)
      throw diffFSM;

    LearnerGraph mergedSmall = PairQualityLearner.mergeStatesForUnique(smallGraph,labelToMerge);
    diffFSM = WMethod.checkM(smallGraph,mergedSmall);
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
      gd.computeDifference(patcher);

      ChangesRecorder.applyGD_WithRelabelling(graph, patcher.writeGD(TestGD.createDoc()),outcome);
      Assert.assertNull(testDetails(),WMethod.checkM(grB,graph));
      Assert.assertEquals(testDetails(),grB.getStateNumber(),graph.getStateNumber());
      DifferentFSMException ex= WMethod.checkM_and_colours(grB,outcome,VERTEX_COMPARISON_KIND.DEEP);
      Assert.assertNull(testDetails()+ex,WMethod.checkM_and_colours(grB,outcome,VERTEX_COMPARISON_KIND.DEEP));Assert.assertEquals(grB.getStateNumber(),graph.getStateNumber());
      Assert.assertEquals(grB,outcome);
    }
    catch(IOException ex)
    {
View Full Code Here
1901
1902
1903
1904
1905
1906
1907
1908
    LearnerGraph graph = new LearnerGraph(mainConfiguration);
    Assert.assertNull(PairQualityLearner.uniqueFromInitial(graph));
    Assert.assertTrue(graph.pathroutines.automatonConnected());
    LearnerGraph actual = new LearnerGraph(mainConfiguration);graph.pathroutines.removeReachableStatesFromWhichInitIsNotReachable(actual);
    LearnerGraph expected = new LearnerGraph(mainConfiguration);
    DifferentFSMException ex = WMethod.checkM(expected, actual);
    if (ex != null) throw ex;
  }
View Full Code Here
1912
1913
1914
1915
1916
1917
1918
1919
  {
    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B-a->C-b->A","testAutomatonConnected3",mainConfiguration, converter);
    Assert.assertNull(PairQualityLearner.uniqueFromInitial(graph));
    Assert.assertTrue(graph.pathroutines.automatonConnected());
    LearnerGraph actual = new LearnerGraph(mainConfiguration);graph.pathroutines.removeReachableStatesFromWhichInitIsNotReachable(actual);
    DifferentFSMException ex = WMethod.checkM(graph, actual);
    if (ex != null) throw ex;
  }
View Full Code Here
1936
1937
1938
1939
1940
1941
1942
1943
  {
    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B-a->C","testAutomatonConnected4",mainConfiguration, converter);
    Assert.assertFalse(graph.pathroutines.automatonConnected());
    LearnerGraph actual = new LearnerGraph(mainConfiguration);graph.pathroutines.removeReachableStatesFromWhichInitIsNotReachable(actual);
    LearnerGraph expected = new LearnerGraph(mainConfiguration);
    DifferentFSMException ex = WMethod.checkM(expected, actual);
    if (ex != null) throw ex;
  }
View Full Code Here
1947
1948
1949
1950
1951
1952
1953
1954
  {
    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B-a->C-b->A / D-a->D","testAutomatonConnected5",mainConfiguration, converter);
    Assert.assertFalse(graph.pathroutines.automatonConnected());
    LearnerGraph actual = new LearnerGraph(mainConfiguration);graph.pathroutines.removeReachableStatesFromWhichInitIsNotReachable(actual);
    final LearnerGraph expected = FsmParser.buildLearnerGraph("A-a->B-a->C-b->A","testAutomatonConnected3a",mainConfiguration, converter);
    DifferentFSMException ex = WMethod.checkM(expected, actual);
    if (ex != null) throw 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.