Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
A lattice gas automation capable of modeling three-dimensional electromagnetic fields
Journal of Computational Physics
Comparative Study of Cellular-Automata Diffusion Models
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Computation properties of spatial dynamics simulation by probabilistic cellular automata
Future Generation Computer Systems - Special issue: Parallel computing technologies
Computation properties of spatial dynamics simulation by probabilistic cellular automata
Future Generation Computer Systems - Special issue: Parallel computing technologies
Using multi core computers for implementing cellular automata systems
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Composing fine-grained parallel algorithms for spatial dynamics simulation
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Coarse-grained parallelization of cellular-automata simulation algorithms
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Hi-index | 0.00 |
A method is proposed, which is intended for constructing a probabilistic cellular automaton (CA), whose evolution simulates a spatially distributed process, given by a PDE. The heart of the method is the transformation of a real spatial function into a Boolean array whose averaged form approximates the given function. Two parts of a given PDE (a differential operator and a function) are approximated by a combination of their Boolean counterparts. The resulting CA transition function has a basic (standard) part, modeling the differential operator and the updating part modifying it according to the function value. Special attention is paid to the reaction-diffusion type of PDE. Some experimental results of simple processes simulation are given and perspectives of the proposed method application are discussed.