sequentialcircuitexperiment.java

来自「Java遗传算法库」· Java 代码 · 共 28 行

/*
 * SequentialCircuitExperiment.java
 *
 * Created on 13 June 2003, 12:09
 */

package jaga.pj.circuits.experiment;

/**
 *
 * @author  mmg20
 */
public interface SequentialCircuitExperiment extends jaga.experiment.Experiment {
    /** @return Array of positions in last test pattern generated of when the tested FSM - if perfect -
     * would enter each state.  So State N is entered at input data position rv[ N ].  The order of states
     * is not important as long as rv[ i ] != rv[ j ] for i != j
     */
    public int[] getStateEnterPos();
    
    /** @return Array of Mealy Finite State Machine Nodes.  The nth node in the array represents the state
     * for which the nth int in the array returned by getStateEnterPos() represents the position in the TP at which
     * this state is entered.
     */
    public MealyFSMNode[] getStateGraphNodes();
    
    public int rndStatePos();
}