Examples of statechum.analysis.learning.MarkovUniversalLearner.checkFanoutInconsistency()

Class statechum.analysis.learning.MarkovUniversalLearner

Examples of statechum.analysis.learning.MarkovUniversalLearner.checkFanoutInconsistency()

statechum.analysis.learning.MarkovUniversalLearner.checkFanoutInconsistency()
Uses the supplied Markov matrix to check if predicted transitions from specific states match those that actually exist.
- Where predictForwardOrSideways is true, we are predicting transitions based on paths leading to the state of interest. Parameter Inverse_Graph should be the (non-deterministic) inverse of graph.
- Where predictForwardOrSideways is false, we are predicting transitions based on paths leading from the state of interest (sideways predictions). Parameter Inverse_Graph should be the same as graph and pathBeyondCurrentState should be null because once we predicted one transition, there are no further transitions from that state, hence no further transitions can be predicted sideways.
@param Inverse_Graph graph used to compute all paths of specific length leading to a state of interest @param predictForwardOrSideways true if this is to predict forward (usual Markov) or false for sideways. @param vert state of interest @param chunkLength length of paths to consider (before the pathBeyondCurrentState component). @param checker consistency checker, usually based on a static method from {@link MarkovOutcome}.

    Assert.assertTrue(m.getMarkov(true).isEmpty());
    Assert.assertEquals(9,m.getMarkov(false).size());
    
    final LearnerGraph graph2 = FsmParser.buildLearnerGraph("A-a->B","testCheckFanoutInconsistencySideways3",config, converter);
    final AtomicInteger counterA=new AtomicInteger(0),counterB=new AtomicInteger(0);
    Assert.assertEquals(0,m.checkFanoutInconsistency(graph2,false,graph2,graph2.getInit(),m.getChunkLen(), new MarkovUniversalLearner.ConsistencyChecker(){


      @SuppressWarnings("unused")
      @Override
      public boolean consistent(MarkovOutcome actual,MarkovOutcome predicted) {
        counterA.addAndGet(1);

View Full Code Here

    Assert.assertTrue(m.getMarkov(true).isEmpty());
    Assert.assertEquals(9,m.getMarkov(false).size());
    
    final LearnerGraph graph2 = FsmParser.buildLearnerGraph("A-a->B / A-c->A","testCheckFanoutInconsistencySideways4",config, converter);
    final AtomicInteger counterA=new AtomicInteger(0),counterB=new AtomicInteger(0);
    Assert.assertEquals(0,m.checkFanoutInconsistency(graph2,false,graph2,graph2.getInit(),m.getChunkLen(), new MarkovUniversalLearner.ConsistencyChecker(){


      @SuppressWarnings("unused")
      @Override
      public boolean consistent(MarkovOutcome actual,MarkovOutcome predicted) {
        counterA.addAndGet(1);

View Full Code Here

    Assert.assertTrue(m.getMarkov(true).isEmpty());
    Assert.assertEquals(9,m.getMarkov(false).size());
    
    final LearnerGraph graph2 = FsmParser.buildLearnerGraph("A-a->B","testCheckFanoutInconsistencySideways3",config, converter);
    final AtomicInteger counterA=new AtomicInteger(0),counterB=new AtomicInteger(0);
    Assert.assertEquals(0,m.checkFanoutInconsistency(graph2,false,graph2,graph2.getInit(),m.getChunkLen(), new MarkovUniversalLearner.ConsistencyChecker(){


      @SuppressWarnings("unused")
      @Override
      public boolean consistent(MarkovOutcome actual,MarkovOutcome predicted) {
        counterA.addAndGet(1);

View Full Code Here

    Assert.assertTrue(m.getMarkov(true).isEmpty());
    Assert.assertEquals(9,m.getMarkov(false).size());
    
    final LearnerGraph graph2 = FsmParser.buildLearnerGraph("A-a->B / A-c->A","testCheckFanoutInconsistencySideways4",config, converter);
    final AtomicInteger counterA=new AtomicInteger(0),counterB=new AtomicInteger(0);
    Assert.assertEquals(0,m.checkFanoutInconsistency(graph2,false,graph2,graph2.getInit(),m.getChunkLen(), new MarkovUniversalLearner.ConsistencyChecker(){


      @SuppressWarnings("unused")
      @Override
      public boolean consistent(MarkovOutcome actual,MarkovOutcome predicted) {
        counterA.addAndGet(1);

View Full Code Here

    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B / A-c->B / T-b->T-u->T","testCheckFanoutInconsistency1",config, converter);
    
    Configuration shallowCopy = graph.config.copy();shallowCopy.setLearnerCloneGraph(false);
    LearnerGraphND Inverse_Graph = new LearnerGraphND(shallowCopy);
    AbstractPathRoutines.buildInverse(graph,LearnerGraphND.ignoreNone,Inverse_Graph);  // do the inverse to the tentative graph 
    Assert.assertEquals(0,m.checkFanoutInconsistency(Inverse_Graph,graph,graph.findVertex("B"),m.getChunkLen()));
  }
  
  /** One from B with inconsistent predictions. */
  @Test
  public void testCheckFanoutInconsistency1b1()

View Full Code Here

    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B / A-c->B / B-u->F / T-b->T-u->T","testCheckFanoutInconsistency1",config, converter);
    
    Configuration shallowCopy = graph.config.copy();shallowCopy.setLearnerCloneGraph(false);
    LearnerGraphND Inverse_Graph = new LearnerGraphND(shallowCopy);
    AbstractPathRoutines.buildInverse(graph,LearnerGraphND.ignoreNone,Inverse_Graph);  // do the inverse to the tentative graph 
    Assert.assertEquals(1,m.checkFanoutInconsistency(Inverse_Graph,graph,graph.findVertex("B"),m.getChunkLen()));
  }
  
  /** One from B where Markov cannot make up its mind. */
  @Test
  public void testCheckFanoutInconsistency1b2()

View Full Code Here

    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B / A-c->B / B-u->F / T-b->T-u->T","testCheckFanoutInconsistency1",config, converter);
    
    Configuration shallowCopy = graph.config.copy();shallowCopy.setLearnerCloneGraph(false);
    LearnerGraphND Inverse_Graph = new LearnerGraphND(shallowCopy);
    AbstractPathRoutines.buildInverse(graph,LearnerGraphND.ignoreNone,Inverse_Graph);  // do the inverse to the tentative graph 
    Assert.assertEquals(1,m.checkFanoutInconsistency(Inverse_Graph,graph,graph.findVertex("B"),m.getChunkLen()));
  }
  
  /** Transition d exists as positive but should be present as negative according to Markov. */
  @Test
  public void testCheckFanoutInconsistency1c()

View Full Code Here

    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B / A-c->B / B-d->F / T-b->T-u->T-d->T","testCheckFanoutInconsistency1",config, converter);
    
    Configuration shallowCopy = graph.config.copy();shallowCopy.setLearnerCloneGraph(false);
    LearnerGraphND Inverse_Graph = new LearnerGraphND(shallowCopy);
    AbstractPathRoutines.buildInverse(graph,LearnerGraphND.ignoreNone,Inverse_Graph);  // do the inverse to the tentative graph 
    Assert.assertEquals(1,m.checkFanoutInconsistency(Inverse_Graph,graph,graph.findVertex("B"),m.getChunkLen()));
  }
  
  /** Transition d exists as positive but should be absent according to Markov. */
  @Test
  public void testCheckFanoutInconsistency1d()

View Full Code Here

    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B / A-c->B / B-d->F / T-b->T-u->T-d->T","testCheckFanoutInconsistency1",config, converter);
    
    Configuration shallowCopy = graph.config.copy();shallowCopy.setLearnerCloneGraph(false);
    LearnerGraphND Inverse_Graph = new LearnerGraphND(shallowCopy);
    AbstractPathRoutines.buildInverse(graph,LearnerGraphND.ignoreNone,Inverse_Graph);  // do the inverse to the tentative graph 
    Assert.assertEquals(1,m.checkFanoutInconsistency(Inverse_Graph,graph,graph.findVertex("B"),m.getChunkLen()));
  }
  
  /** Transition b exists as negative but should be present as positive according to Markov. */
  @Test
  public void testCheckFanoutInconsistency1e()

View Full Code Here

    final LearnerGraph graph = FsmParser.buildLearnerGraph("A-a->B / A-c->B / B-b-#F / T-b->T-u->T-d->T","testCheckFanoutInconsistency1",config, converter);
    
    Configuration shallowCopy = graph.config.copy();shallowCopy.setLearnerCloneGraph(false);
    LearnerGraphND Inverse_Graph = new LearnerGraphND(shallowCopy);
    AbstractPathRoutines.buildInverse(graph,LearnerGraphND.ignoreNone,Inverse_Graph);  // do the inverse to the tentative graph 
    Assert.assertEquals(1,m.checkFanoutInconsistency(Inverse_Graph,graph,graph.findVertex("B"),m.getChunkLen()));
  }
  
  /** Transition d exists as negative but should be absent according to Markov. */
  @Test
  public void testCheckFanoutInconsistency1f()

View Full Code Here

0 1 2 3 4

TOP

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.