current version:   not known
      public distribution:   no
      name:   Renata Napolitano, Claudia Di Napoli
      WWW home page:   ---
General information about the software
      WWW information:   ---
      Literature:   Napoli:1996:CLC

Hardware and software requirements

Environment 1
      compiler runs on:   Cray YMP
      simulation runs on:   Cray YMP
Environment 2
      compiler runs on:   Sun workstation
      simulation runs on:   Sun workstation clusters under PVM

Standard CA

      lattice structure:   2-dimensional Euclidean grids
      lattice size:   squares of arbitrary extent
      boundary conditions:   toroidal, adiabatic
      limitations:   Moore neighborhood, von Neumann neighborhood, and hexagonal neighborhood with radius 1
      notation:   symbolic names
      grouping constructs:   no
Set of states
      max size:   unbounded
      structure:   yes
           how:   registers (called properties in CANL)
           data types:   floating point
Local rule
      limitations:   none


Local rule
      probabilistic rules:   yes
      block rules:   no
      moving objects:   no
Global rule
      asynchronous CA:   no
Temporal inhomogeneity:    yes
      how:   A global step counter can be maintained and accessed.
Spatial inhomogeneity:    yes
      how:   CANL allows the simulation of networks of CA.
Hierarchical aspects:    yes
      how:   networks of CA
Further remarks:    It is possible to use global variables which can be read (and even written) by all cells.

BibTeX entries

All entries in one file, comprising   Napoli:1996:CLC

Further remarks

It seems that what are called ``networks of CA'' by Napoli:1996:CLC can be simulated by \cpe{Hical}'s module mechanism. The advantage of the approach in CANL may be, that the control parallelism can be exploited in a parallel implementation.
This page has been automatically generated on Sat May 3 14:14:54 1997
Please send questions, remarks, updates to Thomas Worsch <>