Package statechum.analysis.learning.rpnicore.Linear

Examples of statechum.analysis.learning.rpnicore.Linear.DetermineDiagonalAndRightHandSide.compute()

337
338
339
340
341
342
343
344
345
346
347
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b-#B1\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), config);
    gr.linear.moveRejectToHightlight();
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_highlight();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("C")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("S")),gr.transitionMatrix.get(gr.findVertex("C")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("C")),gr.transitionMatrix.get(gr.findVertex("A")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("C")),gr.transitionMatrix.get(gr.findVertex("S")));
    Assert.assertEquals(0,matcher.getRightHandSide());
View Full Code Here
339
340
341
342
343
344
345
346
347
348
349
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_highlight();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("C")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("S")),gr.transitionMatrix.get(gr.findVertex("C")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("C")),gr.transitionMatrix.get(gr.findVertex("A")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("C")),gr.transitionMatrix.get(gr.findVertex("S")));
    Assert.assertEquals(0,matcher.getRightHandSide());
  }
View Full Code Here
341
342
343
344
345
346
347
348
349
350
351
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("S")),gr.transitionMatrix.get(gr.findVertex("C")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("C")),gr.transitionMatrix.get(gr.findVertex("A")));
    Assert.assertEquals(0,matcher.getRightHandSide());
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("C")),gr.transitionMatrix.get(gr.findVertex("S")));
    Assert.assertEquals(0,matcher.getRightHandSide());
  }


  @Test
View Full Code Here
351
352
353
354
355
356
357
358
359
360
361
  @Test
  public final void testCountMatchingOutgoing6a()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b-#B1\nQ-a->R", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("R")));
    Assert.assertEquals(0,matcher.getRightHandSide());
  }
 
  @Test
  public final void testCountMatchingOutgoing6b()
View Full Code Here
361
362
363
364
365
366
367
368
369
370
371
  public final void testCountMatchingOutgoing6b()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b-#B1\nQ-a->R", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    gr.linear.moveRejectToHightlight();
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_highlight();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("R")));
    Assert.assertEquals(0,matcher.getRightHandSide());
  }
 
 
  /** Adds reject vertices with names starting with a given prefix, and
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.