Process / pipelineSimulation / optimization
确定性元胞自动机 — 基于规则的网格离散动力学模拟
确定性元胞自动机（Deterministic Cellular Automata, DCA）是一种模拟方法，它通过一个规则的单元格网格来模拟复杂系统的演化。每个单元格都持有一个离散状态，并根据应用于该单元格及其邻居的固定确定性规则，在每个时间步同步更新。在相同的初始条件和规则集下，结果是完全可复现的。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- von Neumann, J. (1966). Theory of Self-Reproducing Automata. University of Illinois Press, Urbana, IL. (Edited and completed by A. W. Burks.) link ↗
- Wolfram, S. (1983). Statistical mechanics of cellular automata. Reviews of Modern Physics, 55(3), 601–644. DOI: 10.1103/RevModPhys.55.601 ↗
如何引用本页
ScholarGate. (2026, June 3). Deterministic Cellular Automata — Rule-based discrete dynamical simulation on a grid. ScholarGate. https://scholargate.app/zh/simulation/deterministic-cellular-automata
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 基于主体的建模（ABM）仿真↔ compare
- 离散事件仿真 (DES)仿真↔ compare
- 马尔可夫模型仿真↔ compare
- 蒙特卡洛模拟决策↔ compare
- 随机元胞自动机仿真↔ compare
- 系统动力学仿真↔ compare