IEICE TRANSACTIONS on Information
The Development of a Computational Environment for Cellular Automata
Summary :
In this paper, we introduce and describe the computational environment that we have developed for cellular automata (CA). CA are powerful methods to understand and simulate the behavior of complex systems such as traffic jams, fluid crosscurrents, and natural disasters. In CA method, modeling of such a system or a phenomenon is to define a transition function, which determines local interactions, so-called "CA rules." However, no systematic method for design of CA rules has been established. We require a CA simulator for "trial and error" in study of modeling based on CA. Furthermore, the CA simulation environment that does not require special knowledge of a user for parallel processing is desired. The purpose of this study is to develop a comprehensive system that enables us to expedite the design of local rules and to accelerate simulations. We have implemented two kinds of simulators differing in their characteristics to improve both design efficiency and execution speed. The major difference between the two simulators is whether a source code is compiled or not. The source code is described in DORA language the authors have designed for the system. DORA language is designed for describing CA rules simply.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.9 pp.2105-2112
- Publication Date
- 2005/09/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.9.2105
- Type of Manuscript
- PAPER
- Category
- Automata and Formal Language Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yuhei AKAMINE, Satoshi ENDO, Koji YAMADA, "The Development of a Computational Environment for Cellular Automata" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 9, pp. 2105-2112, September 2005, doi: 10.1093/ietisy/e88-d.9.2105.
Abstract: In this paper, we introduce and describe the computational environment that we have developed for cellular automata (CA). CA are powerful methods to understand and simulate the behavior of complex systems such as traffic jams, fluid crosscurrents, and natural disasters. In CA method, modeling of such a system or a phenomenon is to define a transition function, which determines local interactions, so-called "CA rules." However, no systematic method for design of CA rules has been established. We require a CA simulator for "trial and error" in study of modeling based on CA. Furthermore, the CA simulation environment that does not require special knowledge of a user for parallel processing is desired. The purpose of this study is to develop a comprehensive system that enables us to expedite the design of local rules and to accelerate simulations. We have implemented two kinds of simulators differing in their characteristics to improve both design efficiency and execution speed. The major difference between the two simulators is whether a source code is compiled or not. The source code is described in DORA language the authors have designed for the system. DORA language is designed for describing CA rules simply.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.9.2105/_p
Copy
@ARTICLE{e88-d_9_2105,
author={Yuhei AKAMINE, Satoshi ENDO, Koji YAMADA, },
journal={IEICE TRANSACTIONS on Information},
title={The Development of a Computational Environment for Cellular Automata},
year={2005},
volume={E88-D},
number={9},
pages={2105-2112},
abstract={In this paper, we introduce and describe the computational environment that we have developed for cellular automata (CA). CA are powerful methods to understand and simulate the behavior of complex systems such as traffic jams, fluid crosscurrents, and natural disasters. In CA method, modeling of such a system or a phenomenon is to define a transition function, which determines local interactions, so-called "CA rules." However, no systematic method for design of CA rules has been established. We require a CA simulator for "trial and error" in study of modeling based on CA. Furthermore, the CA simulation environment that does not require special knowledge of a user for parallel processing is desired. The purpose of this study is to develop a comprehensive system that enables us to expedite the design of local rules and to accelerate simulations. We have implemented two kinds of simulators differing in their characteristics to improve both design efficiency and execution speed. The major difference between the two simulators is whether a source code is compiled or not. The source code is described in DORA language the authors have designed for the system. DORA language is designed for describing CA rules simply.},
keywords={},
doi={10.1093/ietisy/e88-d.9.2105},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - The Development of a Computational Environment for Cellular Automata
T2 - IEICE TRANSACTIONS on Information
SP - 2105
EP - 2112
AU - Yuhei AKAMINE
AU - Satoshi ENDO
AU - Koji YAMADA
PY - 2005
DO - 10.1093/ietisy/e88-d.9.2105
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2005
AB - In this paper, we introduce and describe the computational environment that we have developed for cellular automata (CA). CA are powerful methods to understand and simulate the behavior of complex systems such as traffic jams, fluid crosscurrents, and natural disasters. In CA method, modeling of such a system or a phenomenon is to define a transition function, which determines local interactions, so-called "CA rules." However, no systematic method for design of CA rules has been established. We require a CA simulator for "trial and error" in study of modeling based on CA. Furthermore, the CA simulation environment that does not require special knowledge of a user for parallel processing is desired. The purpose of this study is to develop a comprehensive system that enables us to expedite the design of local rules and to accelerate simulations. We have implemented two kinds of simulators differing in their characteristics to improve both design efficiency and execution speed. The major difference between the two simulators is whether a source code is compiled or not. The source code is described in DORA language the authors have designed for the system. DORA language is designed for describing CA rules simply.
ER -
English
