Package statechum.model.testset.PTASequenceEngine

Examples of statechum.model.testset.PTASequenceEngine.FilterPredicate

144
145
146
147
148
149
150
151
152
153
154
        pta.paths.augmentPTA(seq, referenceGraph.getVertex(seq) != null, false, null);
      }*/
      //pta.paths.augmentPTA(referenceGraph.wmethod.computeNewTestSet(referenceGraph.getInit(),1));// this one will not set any states as rejects because it uses shouldbereturned
      //referenceGraph.pathroutines.completeGraph(referenceGraph.nextID(false));
      if (onlyUsePositives)
        pta.paths.augmentPTA(generator.getAllSequences(0).filter(new FilterPredicate() {
          @Override
          public boolean shouldBeReturned(Object name) {
            return ((statechum.analysis.learning.rpnicore.RandomPathGenerator.StateName)name).accept;
          }
        }));
View Full Code Here
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
              return len;
            }
          });

        if (onlyUsePositives)
          pta.paths.augmentPTA(generator.getAllSequences(0).filter(new FilterPredicate() {
            @Override
            public boolean shouldBeReturned(Object name) {
              return ((statechum.analysis.learning.rpnicore.RandomPathGenerator.StateName)name).accept;
            }
          }));
        else
          pta.paths.augmentPTA(generator.getAllSequences(0));// the PTA will have very few reject-states because we are generating few sequences and hence there will be few negative sequences.
          // In order to approximate the behaviour of our case study, we need to compute which pairs are not allowed from a reference graph and use those as if-then automata to start the inference.
        //pta.paths.augmentPTA(referenceGraph.wmethod.computeNewTestSet(referenceGraph.getInit(),1));
   
        List<List<Label>> sPlus = generator.getAllSequences(0).getData(new FilterPredicate() {
          @Override
          public boolean shouldBeReturned(Object name) {
            return ((statechum.analysis.learning.rpnicore.RandomPathGenerator.StateName)name).accept;
          }
        });
        List<List<Label>> sMinus= generator.getAllSequences(0).getData(new FilterPredicate() {
          @Override
          public boolean shouldBeReturned(Object name) {
            return !((statechum.analysis.learning.rpnicore.RandomPathGenerator.StateName)name).accept;
          }
        });
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
    */
    final RandomPathGenerator generator = new RandomPathGenerator(cvsGraph,new Random(0),5,null);
    final int posOrNegPerChunk = 45;
    generator.generateRandomPosNeg(posOrNegPerChunk*2,1);

    System.out.println(generator.getAllSequences(0).getData(new FilterPredicate()
    {
      @Override
      public boolean shouldBeReturned(Object name) {
        return !generator.getAllSequences(0).getFSM().shouldBeReturned(name);
      }
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
    */
    final RandomPathGenerator generator = new RandomPathGenerator(cvsGraph,new Random(0),5,null);
    final int posOrNegPerChunk = 45;
    generator.generateRandomPosNeg(posOrNegPerChunk*2,1);

    System.out.println(generator.getAllSequences(0).getData(new FilterPredicate()
    {
      @Override
      public boolean shouldBeReturned(Object name) {
        return !generator.getAllSequences(0).getFSM().shouldBeReturned(name);
      }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
    */
    final RandomPathGenerator generator = new RandomPathGenerator(cvsGraph,new Random(0),5,null);
    final int posOrNegPerChunk = 45;
    generator.generateRandomPosNeg(posOrNegPerChunk*2,1);

    System.out.println(generator.getAllSequences(0).getData(new FilterPredicate()
    {
      @Override
      public boolean shouldBeReturned(Object name) {
        return !generator.getAllSequences(0).getFSM().shouldBeReturned(name);
      }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    rpg.generatePosNeg(2*nrPerChunk , 100/percentPerChunk);
    for(int i=0;i<10;i++){
      final PTASequenceEngine samples = rpg.getAllSequences(i);
     
      PTASequenceEngine.FilterPredicate posPredicate = samples.getFSM_filterPredicate();
      PTASequenceEngine.FilterPredicate negPredicate = new FilterPredicate() {
        FilterPredicate origFilter = samples.getFSM_filterPredicate();
        public @Override boolean shouldBeReturned(Object name) {
          return !origFilter.shouldBeReturned(name);
        }
      };
View Full Code Here
521
522
523
524
525
526
527
528
529
530
531
      final PTASequenceEngine currentPTA = generator.getAllSequences(i);
      Collection<List<String>> currentSequences = currentPTA.getData(PTASequenceEngine.truePred);
      Assert.assertEquals("chunk "+i+" (neg) should be of length "+(2*posOrNegPerChunk*(i+1))+" but it was "+currentSequences.size(),(2*posOrNegPerChunk*(i+1)), currentSequences.size());
      int positive = 0,negative=0;
      PTASequenceEngine positivePTA = currentPTA.filter(currentPTA.getFSM_filterPredicate());
      PTASequenceEngine negativePTA = currentPTA.filter(new FilterPredicate() {
        FilterPredicate origFilter = currentPTA.getFSM_filterPredicate();
       
        @Override
        public boolean shouldBeReturned(Object name) {
          return !origFilter.shouldBeReturned(name);
View Full Code Here
586
587
588
589
590
591
592
593
594
595
596
      generator.getExtraSequences(1);
    }},IllegalArgumentException.class,"is out of range");
    Assert.assertTrue("PTA is not empty",generator.getExtraSequences(0).containsAsLeaf(Arrays.asList(new String[]{})));
    final PTASequenceEngine currentPTA = generator.getAllSequences(0);
    PTASequenceEngine positivePTA = currentPTA.filter(currentPTA.getFSM_filterPredicate());
    PTASequenceEngine negativePTA = currentPTA.filter(new FilterPredicate() {
      FilterPredicate origFilter = currentPTA.getFSM_filterPredicate();
     
      @Override
      public boolean shouldBeReturned(Object name) {
        return !origFilter.shouldBeReturned(name);
View Full Code Here
659
660
661
662
663
664
665
666
667
668
669
      final PTASequenceEngine currentPTA = generator.getAllSequences(i);
      Collection<List<String>> currentSequences = currentPTA.getData(PTASequenceEngine.truePred);
      Assert.assertTrue(2*posOrNegPerChunk*(i+1)> currentSequences.size());
      int positive = 0,negative=0;
      PTASequenceEngine positivePTA = currentPTA.filter(currentPTA.getFSM_filterPredicate());
      PTASequenceEngine negativePTA = currentPTA.filter(new FilterPredicate() {
        FilterPredicate origFilter = currentPTA.getFSM_filterPredicate();
       
        @Override
        public boolean shouldBeReturned(Object name) {
          return !origFilter.shouldBeReturned(name);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
    rpg.generatePosNeg(2*nrPerChunk , 100/percentPerChunk);
    for(int i=0;i<10;i++){
      final PTASequenceEngine samples = rpg.getAllSequences(i);
     
      PTASequenceEngine.FilterPredicate posPredicate = samples.getFSM_filterPredicate();
      PTASequenceEngine.FilterPredicate negPredicate = new FilterPredicate() {
        FilterPredicate origFilter = samples.getFSM_filterPredicate();
        public @Override boolean shouldBeReturned(Object name) {
          return !origFilter.shouldBeReturned(name);
        }
      };
View Full Code Here
TOP

Related Classes of statechum.model.testset.PTASequenceEngine.FilterPredicate

  • statechum.analysis.learning.experiments.ManualAccuracyTracker
  • 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.CVS_With_Random_traces_Generation$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
    • 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.