Examples of statechum.analysis.learning.experiments.ForestFireLabelledStateMachineGenerator

Package statechum.analysis.learning.experiments

Examples of statechum.analysis.learning.experiments.ForestFireLabelledStateMachineGenerator

statechum.analysis.learning.experiments.ForestFireLabelledStateMachineGenerator
Adds an alphabet of a specific size, ensuring that the final machine is deterministic. Also adds the potential of loops to the same state. @author nw

      boolean found = false;
      int diff=0;
      Random connectTransitions = new Random(counter);
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter ^ i,config,converter);
          synchronized(AbstractLearnerGraph.syncObj)
          {// Jung-based routines cannot be multithreaded, see the comment around the above syncObj for details.
            machine = gen.buildMachine(artificialTargetSize);
          }
          if (generateConnected)
          {
            // First, add transitions from states that do not lead anywhere
            final Set<CmpVertex> deadendStates = machine.pathroutines.computeReachableStatesFromWhichInitIsNotReachable();

View Full Code Here

      LearnerGraph machine = null;
      boolean found = false;
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          //ForestFireNDStateMachineGenerator gen = new ForestFireNDStateMachineGenerator(0.365,0.3,0.2,seed,alphabet);
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter,config);
          
          machine = gen.buildMachine(artificialTargetSize);
          machine.setName("forestfire_"+counter);
          int machineSize = machine.getStateNumber();
          sizeSequence.add(machineSize);
          if(Math.abs(machineSize - actualTargetSize)<=error){
            found = true;

View Full Code Here

      LearnerGraph machine = null;
      boolean found = false;
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          //ForestFireNDStateMachineGenerator gen = new ForestFireNDStateMachineGenerator(0.365,0.3,0.2,seed,alphabet);
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter);
          
          machine = gen.buildMachine(artificialTargetSize);
          machine.setName("forestfire_"+counter);
          int machineSize = machine.getStateNumber();
          //System.out.println("generated states: "+machineSize);
          sizeSequence.add(machineSize);

View Full Code Here

      LearnerGraph machine = null;
      boolean found = false;
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          //ForestFireNDStateMachineGenerator gen = new ForestFireNDStateMachineGenerator(0.365,0.3,0.2,seed,alphabet);
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter,config);
          
          machine = gen.buildMachine(artificialTargetSize);
          machine.setName("forestfire_"+counter);
          int machineSize = machine.getStateNumber();
          sizeSequence.add(machineSize);
          if(Math.abs(machineSize - actualTargetSize)<=error){
            found = true;

View Full Code Here

      boolean found = false;
      int diff=0;
      Random connectTransitions = new Random(counter);
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter ^ i,config,converter);
          synchronized(AbstractLearnerGraph.syncObj)
          {// Jung-based routines cannot be multithreaded, see the comment around the above syncObj for details.
            machine = gen.buildMachine(artificialTargetSize);
          }
          if (generateConnected)
          {
            // First, add transitions from states that do not lead anywhere
            final Set<CmpVertex> deadendStates = machine.pathroutines.computeReachableStatesFromWhichInitIsNotReachable();

View Full Code Here

      boolean found = false;
      int diff=0;
      Random connectTransitions = new Random(counter);
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter ^ i,config,converter);
          synchronized(AbstractLearnerGraph.syncObj)
          {// Jung-based routines cannot be multithreaded, see the comment around the above syncObj for details.
            machine = gen.buildMachine(artificialTargetSize);
          }
          if (generateConnected)
          {
            // First, add transitions from states that do not lead anywhere
            final Set<CmpVertex> deadendStates = machine.pathroutines.computeReachableStatesFromWhichInitIsNotReachable();

View Full Code Here

      LearnerGraph machine = null;
      boolean found = false;
      while(!found){
        for(int i = 0; i< phaseSize; i++){
          //ForestFireNDStateMachineGenerator gen = new ForestFireNDStateMachineGenerator(0.365,0.3,0.2,seed,alphabet);
          ForestFireLabelledStateMachineGenerator gen = new ForestFireLabelledStateMachineGenerator(0.365,0.3,0.2,0.2,alphabet,counter,config);
          
          machine = gen.buildMachine(artificialTargetSize);
          machine.setName("forestfire_"+counter);
          int machineSize = machine.getStateNumber();
          sizeSequence.add(machineSize);
          if(Math.abs(machineSize - actualTargetSize)<=error){
            found = true;

View Full Code Here

TOP

Related Classes of statechum.analysis.learning.experiments.ForestFireLabelledStateMachineGenerator

edu.uci.ics.jung.graph.impl.DirectedSparseEdge

statechum.analysis.learning.experiments.mutation.DiffExperiments$MachineGenerator

statechum.Label

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.