Deterministic Transition Rules

The state of every cell is updated once each cycle, according to transition rules, which take into account the cell s current state and the state of cells in the neighborhood. Transition rules may be deterministic, so that the next state of a cell is determined unambiguously by the current state of the CA, or partly or wholly stochastic. 

When such a transition rule is applied, the state of each cell and, therefore, of the entire system varies completely unpredictably from one cycle to the next (Figure 6.9), which is unlikely to be of much scientific interest. No information is stored in the model about the values of the random numbers used to determine the next state of a cell, thus once a new pattern has been created using this rule there is no turning back All knowledge of what has gone before has been destroyed. This irreversibility, when it is impossible to determine what the states of the CA were in the last cycle by inspecting the current state of all cells, is a common feature if the transition rules are partly stochastic. It also arises when deterministic rules are used if two different starting patterns can create the same pattern in the next cycle. 

It might seem that transition rules that are predominantly random would not give rise to interesting behavior, but this is not entirely true. Semirandom rules have a role in adding noise to deterministic simulations and, thus, leading to a simulation that is closer to reality, but even without this role such rules can be of interest. 

Deterministic rules, or a combination of deterministic and random rules, are of more value in science than rules that rely completely on chance. From a particular starting arrangement of cells and states, purely deterministic rules, such as those used by the Game of Life, will always result in exactly the same behavior. Although evolution in the forward direction always takes the same course, the CA is not necessarily reversible because there may be some patterns of cells that could be created by the transition rules from two different precursor patterns. 

Select individuals for the next generation with a probability proportional to the fitness value from a roulette wheel on which the slot size is proportional to the fitness value. Notice that genetic algorithms use probabilistic, not deterministic, transition rules. 

GAs do not require derivative information or other auxiliary knowledge only the objective function and corresponding fitness levels influence the directions of search. GAs use probabilistic transition rules, not deterministic ones. 

This is a question of reaction prediction. In fact, this is a deterministic system. If we knew the rules of chemistry completely, and understood chemical reactivity fully, we should be able to answer this question and to predict the outcome of a reaction. Thus, we might use quantum mechanical calculations for exploring the structure and energetics of various transition states in order to find out which reaction pathway is followed. This requires calculations of quite a high degree of sophistication. In addition, modeling the influence of solvents on... 

State transitions are therefore local in both space and time individual cells evolve iteratively according to a fixed, and usually deterministic, function of the current state of that cell and its neighboring cells. One iteration step of the dynamical evolution is achieved after the simultaneous application of the rule (p to each cell in the lattice C. 

Table 6.2 Number of nodes Ht, C = 0,.. . 4 in the minimal deterministic state transition graph (DSTG) representing the regular language r2t[0, where 0 is an elementary fc = 2, r = 1 CA rule Amax is the maximal eigenvalue of the adjacency matrix for the minimal DSTG and determines the entropy of the limit set in the infinite time limit (see text), Values are taken from Table 1 in [wolf84a. ...

The qualitative nature of the phase boundaries, however, is not simply related to the behavioral class of the deterministic rule corners. For example, while figure 7.7-c shows a phase transition to a class-3 rule, figures 7.7-a and 7.7-b show that the boundaries end at the class-3 rule. Similarly, while in figure 7.7-a the phase transition ends at a class-2 rule, there is only the absorbing stationary state close to the class-2 rule in figure 7.7-c. 

The perspectives start with the development of an antomated tool for a verification of the CPN structure in order to he acceptable for the backward reachabihty analysis. The theory advances include the generalization of transformation rules to composed functions. The second path to explore is the possible of presence of non deterministic time constraints for the transition firing. The study of stochastic firing vectors is also considered as a potential snhject of interest. 

GA is a new parallel optimization search method which is different from the traditional optimization methods in the field of application. Goldberg [114] summarized the differences between GA and traditional optimization method as follows GA operates the code of the solution set not the solution set itself GA searches from one population, not a single solution GA uses the compensation information (fitness function), not derivatives or other complementation knowledge GA uses methods of probability, not the deterministic rule of state transition. 

---