Examples of compute()

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

92
93
94
95
96
97
98
99
100
101
102
      while(stateB_It.hasNext())
      {
        Entry<CmpVertex,Map<String,CmpVertex>> stateB = stateB_It.next();

        int currentStatePair = gr.wmethod.vertexToIntNR(stateB.getKey(),entryA.getKey());
        ddrhInstance.compute(entryA.getValue(),stateB.getValue());
        result.setQuick(currentStatePair, ddrhInstance.getRightHandSide());
        if (stateB.getKey().equals(entryA.getKey())) break; // we only process a triangular subset.
      }
    }
   
View Full Code Here

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

264
265
266
267
268
269
270
271
272
273
274
  @Test
  public final void testCountMatchingOutgoing1()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a->B\nA-b->B\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("Q")));
    Assert.assertEquals(2,matcher.getRightHandSide());
  }

  @Test
  public final void testCountMatchingOutgoing2()
View Full Code Here

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

273
274
275
276
277
278
279
280
281
282
283
  @Test
  public final void testCountMatchingOutgoing2()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a->B\nA-b->B\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("A")));
    Assert.assertEquals(3,matcher.getRightHandSide());
  }

  @Test
  public final void testCountMatchingOutgoing3a()
View Full Code Here

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

282
283
284
285
286
287
288
289
290
291
292
  @Test
  public final void testCountMatchingOutgoing3a()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b->B1\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("Q")));
    Assert.assertEquals(1,matcher.getRightHandSide());
  }

  @Test
  public final void testCountMatchingOutgoing3b()
View Full Code Here

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

293
294
295
296
297
298
299
300
301
302
303
  {
    Configuration config = (Configuration)Configuration.getDefaultConfiguration().clone();
    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("Q")));
    Assert.assertEquals(1,matcher.getRightHandSide());
  }

  @Test
  public final void testCountMatchingOutgoing4a()
View Full Code Here

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

302
303
304
305
306
307
308
309
310
311
312
  @Test
  public final void testCountMatchingOutgoing4a()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b-#B1\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    matcher.compute(gr.transitionMatrix.get(gr.findVertex("A")),gr.transitionMatrix.get(gr.findVertex("Q")));
    Assert.assertEquals(0,matcher.getRightHandSide());
  }

  @Test
  public final void testCountMatchingOutgoing4b()
View Full Code Here

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

313
314
315
316
317
318
319
320
321
322
323
  {
    Configuration config = (Configuration)Configuration.getDefaultConfiguration().clone();
    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("Q")));
    Assert.assertEquals(0,matcher.getRightHandSide());
  }

  @Test
  public final void testCountMatchingOutgoing5a()
View Full Code Here

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

322
323
324
325
326
327
328
329
330
331
332
  @Test
  public final void testCountMatchingOutgoing5a()
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b-#B1\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    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());
  }
View Full Code Here

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

324
325
326
327
328
329
330
331
332
333
334
  {
    LearnerGraph gr=new LearnerGraph(TestFSMAlgo.buildGraph("A-a-#B\nA-b-#B1\nA-c->C\nQ-a->R\nQ-b->S", "testCountMatchingOutgoing1"), Configuration.getDefaultConfiguration());
    DetermineDiagonalAndRightHandSide matcher = new Linear.DDRH_default();
    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());
  }

  @Test
  public final void testCountMatchingOutgoing5b()
View Full Code Here

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

335
336
337
338
339
340
341
342
343
344
345
  {
    Configuration config = (Configuration)Configuration.getDefaultConfiguration().clone();
    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());
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.