Package statechum.analysis.learning.rpnicore

Examples of statechum.analysis.learning.rpnicore.LearnerGraph$FSMImplementation


  }

  @Test
  public final void test_sequenceSet3_6() // a more complex composition
  {
    fsm = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B", "test_sequenceSet3_6"),config);
    en = new PTA_FSMStructure(fsm);   
    SequenceSet seq = en.new SequenceSet();seq.setIdentity();
    Map<String,String> actual = getDebugDataMap(en,seq.crossWithSet(Arrays.asList(new String[] {"b","a"}))
      .crossWithSet(Arrays.asList(new String[] {"b","a"}))
      .crossWithSet(Arrays.asList(new String[] {"a","b"})));
View Full Code Here


  /** Test that it is possible to selectively filter out paths which terminate at specific states. */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned1() // a test for shouldBeReturned
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B", "test_sequenceSet_testing_shouldBeReturned1"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

 
  /** Test that the outcome of filter is not affected by subsequent changes in the original graph. */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned_filter_is_a_copy()
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B-b->B\nA-d->A\nB-c->D-a->D", "test_sequenceSet_testing_shouldBeReturned_filter_is_a_copy"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

  /** Test that it is possible to selectively filter out paths which terminate at specific states. */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned1b()
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B-b->B\nA-d->A", "test_sequenceSet_testing_shouldBeReturned1b"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

  /** Test that it is possible to selectively filter out paths which terminate at specific states. */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned1c()
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B-b->B\nA-d->C-d->C", "test_sequenceSet_testing_shouldBeReturned1c"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

   * In this PTA, there are two different paths with accept on tail nodes. 
   */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned1d()
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B-b->B\nA-d->C-d->C\nB-c->D-c->D-a->D-b->D", "test_sequenceSet_testing_shouldBeReturned1d"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

  /** Test that if I wish to return all paths in a PTA, they will be returned. */
  @Test
  public final void test_sequenceSet_testing_shouldBeReturned1e()
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B-b->B\nA-d->C-d->C\nB-c->D-c->D-a->D-b->D", "test_sequenceSet_testing_shouldBeReturned1d"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(@SuppressWarnings("unused"Object elem) {
View Full Code Here


  @Test
  public final void test_sequenceSet_testing_shouldBeReturned2() // a test for shouldBeReturned
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B", "test_sequenceSet_testing_shouldBeReturned2"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(@SuppressWarnings("unused"Object elem) {
View Full Code Here

  }

  @Test
  public final void test_sequenceSet_testing_shouldBeReturned3() // a test for shouldBeReturned
  {
    final LearnerGraph machine = new LearnerGraph(TestFSMAlgo.buildGraph("A-a->A-b->B", "test_sequenceSet_testing_shouldBeReturned3"),config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

    DirectedSparseVertex init = new DirectedSparseVertex();
    init.addUserDatum(JUConstants.INITIAL, true, UserData.SHARED);
    init.addUserDatum(JUConstants.ACCEPTED, false, UserData.SHARED);
    init.addUserDatum(JUConstants.LABEL, "A", UserData.SHARED);
    g.addVertex(init);
    final LearnerGraph machine = new LearnerGraph(g,config);
    en = new PTA_FSMStructure(machine) {
      {
        init(machine.new FSMImplementation(){
          @Override
          public boolean shouldBeReturned(Object elem) {
View Full Code Here

TOP

Related Classes of statechum.analysis.learning.rpnicore.LearnerGraph$FSMImplementation

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.