Methoden vergleichen

	Deterministic Cellular Automata	Agentenbasiertes Modellieren (ABM)
Fachgebiet	Simulation	Simulation
Familie	Process / pipeline	Process / pipeline
Entstehungsjahr	1940s–1950s	1970s–1990s (formalized as a field)
Urheber	John von Neumann and Stanislaw Ulam	Thomas Schelling and Robert Axelrod (foundational contributions, 1970s–1990s)
Typ	Discrete deterministic grid simulation	Computational simulation method
Wegweisende Quelle	von Neumann, J. (1966). Theory of Self-Reproducing Automata. University of Illinois Press, Urbana, IL. (Edited and completed by A. W. Burks.)	Axelrod, R. (1997). The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press.
Aliasnamen	Deterministic CA, Classical Cellular Automata, Rule-based CA, Finite Automata Grid Model	ABM, Ajan Tabanlı Modelleme (ABM), multi-agent simulation, individual-based modeling
Verwandt	6	5
Zusammenfassung	Deterministic Cellular Automata (DCA) is a simulation method that models the evolution of complex systems through a regular grid of cells, each holding a discrete state, updated synchronously at each time step according to a fixed, deterministic rule applied to the cell and its neighbors. The outcome is fully reproducible given the same initial conditions and rule set.	Agent-based modeling (ABM) is a computational simulation method, formalized through the work of Thomas Schelling and Robert Axelrod in the 1970s–1990s, that simulates the behavior of complex systems by specifying and running autonomous agents — individuals, firms, cells, or any bounded entity — whose local interactions with each other and with their environment collectively produce global, system-level patterns that could not be predicted from any single agent's rules alone.