Package statechum.Configuration

Examples of statechum.Configuration.ScoreMode

136
137
138
139
140
141
142
143
144
145
146
    {
      @Override
      public LearnerGraph MergeAndDeterminize(LearnerGraph original, StatePair pair)
      {
        // Check that compatibility score computation gives the same response as if we did merge and computed a difference between the number of states.
        ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
        long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
        original.config.setLearnerScoreMode(origScore);
        LearnerGraph outcome = super.MergeAndDeterminize(original, pair);
        Assert.assertEquals(compatibilityScore+1,original.getStateNumber()-outcome.getStateNumber());
        return outcome;
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
            extraPhantomVertices = 1;// now certain it was indeed a phantom vertex added when the PTA was initially built.
          }
         
          Assert.assertEquals(score+extraPhantomVertices,original.getStateNumber()-outcome.getStateNumber());
        }
        ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
        long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
        original.config.setLearnerScoreMode(origScore);
       
        Assert.assertEquals(compatibilityScore+1+extraPhantomVertices,original.getStateNumber()-outcome.getStateNumber());
        return outcome;
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
    {
      @Override
      public LearnerGraph MergeAndDeterminize(LearnerGraph original, StatePair pair)
      {
        // Check that compatibility score computation gives the same response as if we did merge and computed a difference between the number of states.
        ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
        long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
        original.config.setLearnerScoreMode(origScore);
        LearnerGraph outcome = super.MergeAndDeterminize(original, pair);
        Assert.assertEquals(compatibilityScore+1,original.getStateNumber()-outcome.getStateNumber());
        return outcome;
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
    {
      @Override
      public LearnerGraph MergeAndDeterminize(LearnerGraph original, StatePair pair)
      {
        // Check that compatibility score computation gives the same response as if we did merge and computed a difference between the number of states.
        ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
        long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
        original.config.setLearnerScoreMode(origScore);
        LearnerGraph outcome = super.MergeAndDeterminize(original, pair);
        Assert.assertEquals(compatibilityScore+1,original.getStateNumber()-outcome.getStateNumber());
        return outcome;
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
    {
      @Override
      public LearnerGraph MergeAndDeterminize(LearnerGraph original, StatePair pair)
      {
        // Check that compatibility score computation gives the same response as if we did merge and computed a difference between the number of states.
        ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
        long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
        original.config.setLearnerScoreMode(origScore);
        LearnerGraph outcome = super.MergeAndDeterminize(original, pair);
        Assert.assertEquals(compatibilityScore+1,original.getStateNumber()-outcome.getStateNumber());
        return outcome;
View Full Code Here
312
313
314
315
316
317
318
319
320
321
322
      for(PairScore p:pairs)
      {
        if (p.getR() == pair.getR())
          ++m.nrOfAlternatives;
      }
      ScoreMode origScore = graph.config.getLearnerScoreMode();graph.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
      m.compatibilityScore = graph.pairscores.computePairCompatibilityScore(pair);
      graph.config.setLearnerScoreMode(origScore);

      measurementsForCurrentStack.put(pair,m);
    }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
            extraPhantomVertices = 1;// now certain it was indeed a phantom vertex added when the PTA was initially built.
          }
         
          Assert.assertEquals(score+extraPhantomVertices,original.getStateNumber()-outcome.getStateNumber());
        }
        ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
        long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
        original.config.setLearnerScoreMode(origScore);
       
        Assert.assertEquals(compatibilityScore+1+extraPhantomVertices,original.getStateNumber()-outcome.getStateNumber());
        return outcome;
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
          ++m.nrOfAlternatives;
      }
     
      Collection<CmpVertex> adjacentOutgoingBlue = tentativeGraph.transitionMatrix.get(pair.getQ()).values(), adjacentOutgoingRed = tentativeGraph.transitionMatrix.get(pair.getR()).values();
      m.adjacent = adjacentOutgoingBlue.contains(pair.getR()) || adjacentOutgoingRed.contains(pair.getQ());
      ScoreMode origScore = tentativeGraph.config.getLearnerScoreMode();tentativeGraph.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
      m.compatibilityScore = tentativeGraph.pairscores.computePairCompatibilityScore(pair);
      tentativeGraph.config.setLearnerScoreMode(origScore);
     
      measurements.measurementsForComparators.put(pair,m);
    }
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
          ++m.nrOfAlternatives;
      }
     
      Collection<CmpVertex> adjacentOutgoingBlue = tentativeGraph.transitionMatrix.get(pair.getQ()).values(), adjacentOutgoingRed = tentativeGraph.transitionMatrix.get(pair.getR()).values();
      m.adjacent = adjacentOutgoingBlue.contains(pair.getR()) || adjacentOutgoingRed.contains(pair.getQ());
      ScoreMode origScore = tentativeGraph.config.getLearnerScoreMode();tentativeGraph.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
      m.compatibilityScore = tentativeGraph.pairscores.computePairCompatibilityScore(pair);
      tentativeGraph.config.setLearnerScoreMode(origScore);
     
      measurements.measurementsForComparators.put(pair,m);
    }
View Full Code Here
191
192
193
194
195
196
197
198
199
200
201
              extraPhantomVertices = 1;// now certain it was indeed a phantom vertex added when the PTA was initially built.
            }
           
            Assert.assertEquals(score+extraPhantomVertices,original.getStateNumber()-outcome.getStateNumber());
          }
          ScoreMode origScore = original.config.getLearnerScoreMode();original.config.setLearnerScoreMode(ScoreMode.COMPATIBILITY);
          long compatibilityScore = original.pairscores.computePairCompatibilityScore(pair);
          original.config.setLearnerScoreMode(origScore);
         
          Assert.assertEquals(compatibilityScore+1+extraPhantomVertices,original.getStateNumber()-outcome.getStateNumber());
          return outcome;
View Full Code Here
TOP

Related Classes of statechum.Configuration.ScoreMode

  • statechum.analysis.learning.experiments.PairQualityLearner
  • statechum.analysis.learning.experiments.PairSelection.WekaDataCollector
  • statechum.analysis.learning.experiments.PaperUAS$RPNIBlueFringeTestVariability
  • statechum.analysis.learning.RPNIBlueFringeVariability
  • statechum.analysis.learning.TestLearnerFromLargePTA$RPNIBlueFringeTestVariability
  • statechum.analysis.learning.TestRpniLearner
    • 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.