Package statechum.DeterministicDirectedSparseGraph

Examples of statechum.DeterministicDirectedSparseGraph.VertID

1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
      Map<CmpVertex,CmpVertex> oldToNew = new HashMap<CmpVertex,CmpVertex>();

      // First, clone vertices
      for(CmpVertex state:graph.transitionMatrix.keySet())
      {
        VertID newID = relabelling.get(state);
        if (newID == null)
          oldToNew.put(state, AbstractLearnerGraph.cloneCmpVertex(state, result.config)); // clone
        else // copy under a different name
        {
          CmpVertex newVertex = AbstractLearnerGraph.generateNewCmpVertex(newID, result.config);// rename
View Full Code Here
281
282
283
284
285
286
287
288
289
290
291
      SampleData dataSample = new SampleData(null,null);
      //dataSample.difference = new DifferenceToReferenceDiff(0, 0);
      //dataSample.differenceForReferenceLearner = new DifferenceToReferenceDiff(0, 0);
      long inconsistencyActual = MarkovClassifier.computeInconsistency(actualAutomaton, m, checker,false);
     
      VertID rejectVertexID = null;
      for(CmpVertex v:actualAutomaton.transitionMatrix.keySet())
        if (!v.isAccept())
        {
          assert rejectVertexID == null : "multiple reject vertices in learnt automaton, such as "+rejectVertexID+" and "+v;
          rejectVertexID = v;break;
View Full Code Here
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
          timerToDetectLongRunningAutomata.schedule(recordPta,1000l*60l*20l);
          actualAutomaton = learnerOfPairs.learnMachine(new LinkedList<List<Label>>(),new LinkedList<List<Label>>());
          recordPta.cancel();
        }
       
        VertID rejectVertexID = null;
        for(CmpVertex v:actualAutomaton.transitionMatrix.keySet())
          if (!v.isAccept())
          {
            assert rejectVertexID == null : "multiple reject vertices in learnt automaton, such as "+rejectVertexID+" and "+v;
            rejectVertexID = v;break;
View Full Code Here
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
  }
 
  /** Adds the supplied prefix to vertex ID provided. */
  static void renameVertex(VertID currID, String prefix,Map<VertID,VertID> oldVerticesToNew)
  {
    VertID currentVertex = oldVerticesToNew.get(currID);
    VertID newID = VertexID.parseID(prefix+(currentVertex==null?"":currentVertex.toString()));
    if (oldVerticesToNew.containsKey(newID) || oldVerticesToNew.containsKey(newID))
      throw new IllegalArgumentException("duplicate vertex "+newID+" in outcome");
    oldVerticesToNew.put(currID,newID);
  }
View Full Code Here
276
277
278
279
280
281
282
283
284
285
286
        SampleData dataSample = new SampleData(null,null);
        //dataSample.difference = new DifferenceToReferenceDiff(0, 0);
        //dataSample.differenceForReferenceLearner = new DifferenceToReferenceDiff(0, 0);
        long inconsistencyActual = MarkovClassifier.computeInconsistency(actualAutomaton, m, checker,false);
       
        VertID rejectVertexID = null;
        for(CmpVertex v:actualAutomaton.transitionMatrix.keySet())
          if (!v.isAccept())
          {
            assert rejectVertexID == null : "multiple reject vertices in learnt automaton, such as "+rejectVertexID+" and "+v;
            rejectVertexID = v;break;
View Full Code Here
761
762
763
764
765
766
767
768
769
770
771
772
      }
      // Add relabelling: first, aTOb , then duplicates. If this is done in a different order
      // we might relabel a vertex to the name already in use and relabel will choke.
      for(Entry<CmpVertex,CmpVertex> entry:aTOb.entrySet())
      {
        VertID from = entry.getKey(), to = newBToOrig.get(entry.getValue());
        if (!from.equals(to))
          addRelabelling(from,to);
      }

      for(CmpVertex vert:duplicates)
        addRelabelling(vert, newBToOrig.get(vert));
View Full Code Here
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
      Map<CmpVertex,CmpVertex> oldToNew = new HashMap<CmpVertex,CmpVertex>();

      // First, clone vertices
      for(CmpVertex state:graph.transitionMatrix.keySet())
      {
        VertID newID = relabelling.get(state);
        if (newID == null)
          oldToNew.put(state, AbstractLearnerGraph.cloneCmpVertex(state, result.config)); // clone
        else // copy under a different name
        {
          CmpVertex newVertex = AbstractLearnerGraph.generateNewCmpVertex(newID, result.config);// rename
View Full Code Here
457
458
459
460
461
462
463
464
465
466
467
        SampleData dataSample = new SampleData(null,null);
        //dataSample.difference = new DifferenceToReferenceDiff(0, 0);
        //dataSample.differenceForReferenceLearner = new DifferenceToReferenceDiff(0, 0);
       
        VertID rejectVertexID = null;
        for(CmpVertex v:actualAutomaton.transitionMatrix.keySet())
          if (!v.isAccept())
          {
            assert rejectVertexID == null : "multiple reject vertices in learnt automaton, such as "+rejectVertexID+" and "+v;
            rejectVertexID = v;break;
View Full Code Here
275
276
277
278
279
280
281
282
283
284
285
        SampleData dataSample = new SampleData(null,null);
        //dataSample.difference = new DifferenceToReferenceDiff(0, 0);
        //dataSample.differenceForReferenceLearner = new DifferenceToReferenceDiff(0, 0);
        long inconsistencyActual = MarkovClassifier.computeInconsistency(actualAutomaton, m, checker,false);
       
        VertID rejectVertexID = null;
        for(CmpVertex v:actualAutomaton.transitionMatrix.keySet())
          if (!v.isAccept())
          {
            assert rejectVertexID == null : "multiple reject vertices in learnt automaton, such as "+rejectVertexID+" and "+v;
            rejectVertexID = v;break;
View Full Code Here
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
  }
 
  /** Adds the supplied prefix to vertex ID provided. */
  static void renameVertex(VertID currID, String prefix,Map<VertID,VertID> oldVerticesToNew)
  {
    VertID currentVertex = oldVerticesToNew.get(currID);
    VertID newID = VertexID.parseID(prefix+(currentVertex==null?"":currentVertex.toString()));
    if (oldVerticesToNew.containsKey(newID) || oldVerticesToNew.containsKey(newID))
      throw new IllegalArgumentException("duplicate vertex "+newID+" in outcome");
    oldVerticesToNew.put(currID,newID);
  }
View Full Code Here
TOP

Related Classes of statechum.DeterministicDirectedSparseGraph.VertID

  • statechum.analysis.learning.experiments.PairSelection.ASE2014$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.Cav2014$LearnerRunner
  • statechum.analysis.learning.experiments.PairSelection.CVS$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.WaveBlueFringe$LearnerRunner
  • statechum.analysis.learning.linear.GD
    • 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.