The random function allows the
construction of probabilistic CA using the following method:
First, for each site a random number between 1 and
is determined and stored in a variable
number.
Then for only one single event < Neighbour configuration>
a special rule table can - just depending on number - provoke different
actions <Consequence 1>, <Consequence 2>, and so on, with probabilities
,
,
... ,
,
.
If the generic cell is itself a member
of the neighbourhood as well, then
nm < n is legal; in this case it will keep its old state with probability
.
Like this, it is automatically guaranteed that the sum
of all probabilities is 1.
...
TABLE
number = rand(1,n);
number>0; number<=n1;
<Neighbour configuration> : <Consequence 1> :
number>n1; number<=n2;
<Neighbour configuration> : <Consequence 2> :
...
|
For further information concerning the structure of SDL programs please refer
to 'Table Part' of SDL.