Package statechum.analysis.learning.rpnicore.WMethod

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

1513
1514
1515
1516
1517
1518
1519
1520
1521
    fsm.pairscores.computePairCompatibilityScore_general(null,Arrays.asList(new StatePair[]{
        new StatePair(fsm.findVertex("I"),fsm.findVertex("A1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("B1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("C1"))
        }), verticesToMerge);
    LearnerGraph mergeOutcome =  MergeStates.mergeCollectionOfVertices(fsm, null, verticesToMerge);
    LearnerGraph expected = FsmParser.buildLearnerGraph("I-d->I-b->I-c->I / I-a->B2-b->B3-c->C1", "testPairCompatible_general_Eb",config,getLabelConverter());
    DifferentFSMException diffEx = WMethod.checkM(expected, mergeOutcome);
    if (diffEx != null)
      throw diffEx;
  }
View Full Code Here
1528
1529
1530
1531
1532
1533
1534
1535
1536
    fsm.pairscores.computePairCompatibilityScore_general(null,Arrays.asList(new StatePair[]{
        new StatePair(fsm.findVertex("I"),fsm.findVertex("A1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("B1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("C1"))
        }), verticesToMerge);
    LearnerGraph mergeOutcome =  MergeStates.mergeCollectionOfVertices(fsm, null, verticesToMerge);
    LearnerGraph expected = FsmParser.buildLearnerGraph("I-b->I-c->I / I-a->I", "testPairCompatible_general_Fb",config,getLabelConverter());
    DifferentFSMException diffEx = WMethod.checkM(expected, mergeOutcome);
    if (diffEx != null)
      throw diffEx;
  }
View Full Code Here
1543
1544
1545
1546
1547
1548
1549
1550
1551
    fsm.pairscores.computePairCompatibilityScore_general(null,Arrays.asList(new StatePair[]{
        new StatePair(fsm.findVertex("I"),fsm.findVertex("A1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("B1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("C1"))
        }), verticesToMerge);
    LearnerGraph mergeOutcome =  MergeStates.mergeCollectionOfVertices(fsm, null, verticesToMerge);
    LearnerGraph expected = FsmParser.buildLearnerGraph("I-d->I-b->I-c->I / I-a->B2-b->B3-c->C1 / I-e->B2", "testPairCompatible_general_Gb",config,getLabelConverter());
    DifferentFSMException diffEx = WMethod.checkM(expected, mergeOutcome);
    if (diffEx != null)
      throw diffEx;
  }
View Full Code Here
1558
1559
1560
1561
1562
1563
1564
1565
1566
    fsm.pairscores.computePairCompatibilityScore_general(null,Arrays.asList(new StatePair[]{
        new StatePair(fsm.findVertex("I"),fsm.findVertex("A1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("B1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("C1"))
        }), verticesToMerge);
    LearnerGraph mergeOutcome =  MergeStates.mergeCollectionOfVertices(fsm, null, verticesToMerge);
    LearnerGraph expected = FsmParser.buildLearnerGraph("I-b->I-c->I / I-a->I-d->I", "testPairCompatible_general_Hb",config,getLabelConverter());
    DifferentFSMException diffEx = WMethod.checkM(expected, mergeOutcome);
    if (diffEx != null)
      throw diffEx;
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
   */
  protected final boolean compareInDepth;

  protected void checkGraphEquality(LearnerGraph what, LearnerGraph with)
  {
    DifferentFSMException ex = null;
    if (compareInDepth)
    {
      //if (!what.equals(with))
      //  ex = new DifferentFSMException("machines differ");
      ex = WMethod.checkM_and_colours(what,with,VERTEX_COMPARISON_KIND.DEEP);
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
  }

  /** Converts the existing checkM into its eqivalent in version 322. */
  public static DifferentFSMException checkM(LearnerGraph A, CmpVertex Ainit, LearnerGraph B, CmpVertex Binit)
  {
    DifferentFSMException result = null;
    try {
      WMethod.checkM(A, B, Ainit, Binit);
    } catch (DifferentFSMException e) {
      result = e;
    }
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
  }
 
  /** Converts the existing checkM into its eqivalent in version 322. */
  public static DifferentFSMException checkM(LearnerGraph A, LearnerGraph B)
  {
    DifferentFSMException result = null;
    try {
      WMethod.checkM(A, B);
    } catch (DifferentFSMException e) {
      result = e;
    }
View Full Code Here
664
665
666
667
668
669
670
671
672
    graph.config.setLearnerIdMode(Configuration.IDMode.POSITIVE_NEGATIVE);
    graph.paths.augmentPTA(minusStrings, false,true);

    final LearnerGraph expected = new LearnerGraph(mainConfiguration.copy());
    expected.getVertex(new LinkedList<Label>()).setAccept(false);
    DifferentFSMException result = WMethod.checkM(expected,graph);
    Assert.assertNull(result);
    checkDepthLabelling(graph);
  }
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
1513
1514
1515
1516
1517
1518
1519
1520
1521
    fsm.pairscores.computePairCompatibilityScore_general(null,Arrays.asList(new StatePair[]{
        new StatePair(fsm.findVertex("I"),fsm.findVertex("A1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("B1")),new StatePair(fsm.findVertex("I"),fsm.findVertex("C1"))
        }), verticesToMerge);
    LearnerGraph mergeOutcome =  MergeStates.mergeCollectionOfVertices(fsm, null, verticesToMerge);
    LearnerGraph expected = FsmParser.buildLearnerGraph("I-d->I-b->I-c->I / I-a->B2-b->B3-c->C1", "testPairCompatible_general_Eb",config,getLabelConverter());
    DifferentFSMException diffEx = WMethod.checkM(expected, mergeOutcome);
    if (diffEx != null)
      throw diffEx;
  }
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.