Package statechum.analysis.learning.experiments.mutation.DiffExperiments

Examples of statechum.analysis.learning.experiments.mutation.DiffExperiments.MachineGenerator

243
244
245
246
247
248
249
250
251
252
253
254
255
    @Override
    public ThreadResult call() throws Exception
    {
      final int alphabet = 2*states;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);

      final LearnerGraph referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,states*alphabet);
     
      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
184
      final int alphabet = (int)(alphabetMultiplier*states);
      final int tracesAlphabet = (int)(tracesAlphabetMultiplier*states);
     
      LearnerGraph referenceGraph = null;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,makeEven(states*tracesAlphabet));

      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
      final int alphabet = (int)(alphabetMultiplier*states);
      final int tracesAlphabet = (int)(tracesAlphabetMultiplier*states);
     
      LearnerGraph referenceGraph = null;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,makeEven(states*tracesAlphabet));

      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
394
395
396
397
398
399
400
401
402
403
404
405
    public ThreadResult call() throws Exception
    {
      final int alphabet = (int)(alphabetMultiplier*states);
      LearnerGraph referenceGraph = null;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,makeEven(states*alphabet));

      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
      final int alphabet = (int)(alphabetMultiplier*states);
      final int tracesAlphabet = (int)(tracesAlphabetMultiplier*states);
     
      LearnerGraph referenceGraph = null;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,makeEven(states*tracesAlphabet));

      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
394
395
396
397
398
399
400
401
402
403
404
405
    public ThreadResult call() throws Exception
    {
      final int alphabet = (int)(alphabetMultiplier*states);
      LearnerGraph referenceGraph = null;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,makeEven(states*alphabet));

      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
97
    final int alphabet = 2*states;
    LearnerGraph referenceGraph = null;
    ThreadResult outcome = new ThreadResult();
    Label uniqueFromInitial = null;
    final boolean pickUniqueFromInitial = true;
    MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
    do
    {
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
      if (pickUniqueFromInitial)
      {
        Map<Label,CmpVertex> uniques = PairQualityLearner.uniqueFromState(referenceGraph);
        if(!uniques.isEmpty())
        {
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
181
      final int alphabet = (int)(alphabetMultiplier*states);
      final int tracesAlphabet = (int)(tracesAlphabetMultiplier*states);
     
      LearnerGraph referenceGraph = null;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,makeEven(states*tracesAlphabet));

      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
254
255
    @Override
    public ThreadResult call() throws Exception
    {
      final int alphabet = 2*states;
      ThreadResult outcome = new ThreadResult();
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);

      final LearnerGraph referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
     
      LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
      final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,states*alphabet);
     
      for(int attempt=0;attempt<2;++attempt)
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
    final int states=minStateNumber;
    final int alphabet = (int)(alphabetMultiplier*states);
    final int seed = traceQuantity;
   
    LearnerGraph referenceGraph = null;
    MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
    referenceGraph = mg.nextMachine(alphabet,seed, config, converter).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, because we assume that undefined transitions lead to reject states.
   
    LearnerEvaluationConfiguration learnerEval = new LearnerEvaluationConfiguration(config);learnerEval.setLabelConverter(converter);
    //final Collection<List<Label>> testSet = PaperUAS.computeEvaluationSet(referenceGraph,states*3,PairQualityLearner.makeEven(states*alphabet*traceMultiplier));

    final int attempt=0;
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.experiments.mutation.DiffExperiments.MachineGenerator

  • statechum.analysis.Erlang.TestSynapseAuxiliaryFunctions
  • statechum.analysis.learning.experiments.PairSelection.ASE2014$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$EvaluationOfExisingLearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.MarkovLearnerExperimentWithStatisticalAnalysis$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.MarkovPassivePairSelection$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.PairQualityLearner$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.SmallvsHugeExperiment
  • statechum.analysis.learning.experiments.PairSelection.TestLearnFromTracesUsingMarkov
  • statechum.analysis.learning.experiments.PairSelection.WaveBlueFringe$LearnerRunner
    • 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.