セルラ・オートマトン・シミュレータ用インタプリタの開発

概要

論文の詳細を見る
Cellular Automata (CA), which is a method for analyzing phenomena of complex systems, allows us to construct many kinds of simulators such as road traffic simulators. When we design a CA model, we need a CA simulator for verification of its result. However, at the present, we need to develop a software simulator since CA dedicated computers have not been generalized yet. We need to use a trial and error method with the simulator for design of local rules, which is the main process of making CA models. We have developed an interpreter that makes this process easily. Giving the system a local rule described in a CA dedicated language, the user can instantly confirm the result. When the user change the rules, the system reflects his changes immediately. Our system does not regulate to design the local rules belonging to the CA category because the system is a general purpose CA simulator that adopts the method by description in the special language for definitions of local rules. We can modify a rule dramatically since the system interprets a rule description language in runtime. Furthermore, we can change variable parameters using GUI interfaces. Whereby they iterate to change a rule, a conflictive conditional statement sometimes occurs in a description of local rules. This conflict is far from seeking generally. Our system detects such a conflict automatically and notifies it to users as an error.
社団法人　人工知能学会の論文
2002-11-01