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

Examples of statechum.analysis.learning.experiments.mutation.DiffExperiments.MachineGenerator.nextMachine()

719
720
721
722
723
724
725
726
727
728
729
      ThreadResult outcome = new ThreadResult();
      Label uniqueFromInitial = null;
      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 = uniqueFromState(referenceGraph);
          if(!uniques.isEmpty())
          {
View Full Code Here
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
      ThreadResult outcome = new ThreadResult();
      Label uniqueFromInitial = null;
      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 = uniqueFromState(referenceGraph);
          if(!uniques.isEmpty())
          {
View Full Code Here
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
      Label uniqueFromInitial = null;
      Timer timerToDetectLongRunningAutomata = new Timer("timer_to_detect_lengthy_tasks");
      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 = uniqueFromState(referenceGraph);
          if(!uniques.isEmpty())
          {
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
    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
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
    @Test
    public final void testRandomFSMMergers() throws IncompatibleStatesException
    {
      final int states = 50;
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      LearnerGraph referenceGraph = mg.nextMachine(states/2,fsmNumber, config,getLabelConverter()).pathroutines.buildDeterministicGraph();// reference graph has no reject-states, in the mergers below we can still attempt to merge arbitrary subsets of states.

      for(CmpVertex a:referenceGraph.transitionMatrix.keySet())
        for(CmpVertex b:referenceGraph.transitionMatrix.keySet())
        {
          Collection<AMEquivalenceClass<CmpVertex,LearnerGraphCachedData>> verticesToMerge = new LinkedList<AMEquivalenceClass<CmpVertex,LearnerGraphCachedData>>();
View Full Code Here
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
      Label uniqueFromInitial = null;
      Timer timerToDetectLongRunningAutomata = new Timer("timer_to_detect_lengthy_tasks");
      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 = uniqueFromState(referenceGraph);
          if(!uniques.isEmpty())
          {
View Full Code Here
830
831
832
833
834
835
836
837
838
839
840
      ThreadResult outcome = new ThreadResult();
      Label uniqueFromInitial = null;
      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 = uniqueFromState(referenceGraph);
          if(!uniques.isEmpty())
          {
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
    Random rnd=new Random(0);
    for(int states=1;states < 100;states++)
    {
      final int alphabet = 2*states;
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      LearnerGraph graph = mg.nextMachine(alphabet,-states, config, converter).pathroutines.buildDeterministicGraph();
           
      LearnerGraph parsedOutcome = new LearnerGraph(config);
      StatechumProcess.parseStatemachine(StatechumProcess.constructFSM(graph), parsedOutcome, converter,true);
      DifferentFSMException diffException = WMethod.checkM(graph, parsedOutcome);
      Assert.assertNull(diffException);
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
   
    for(int states=1;states < 100;states++)
    {
      final int alphabet = 2*states;
      MachineGenerator mg = new MachineGenerator(states, 400 , (int)Math.round((double)states/5));mg.setGenerateConnected(true);
      LearnerGraphND graph = mg.nextMachine(alphabet,-states, config, converter);
     
      LearnerGraphND parsedOutcome = new LearnerGraphND(config);
      StatechumProcess.parseStatemachine(StatechumProcess.constructFSM(graph), parsedOutcome, converter,true);
      DifferentFSMException diffException = WMethod.checkM(graph, parsedOutcome);
      Assert.assertNull(diffException);
View Full Code Here
175
176
177
178
179
180
181
182
183
184
185
      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
TOP
Copyright © 2018 www.massapi.com. 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.