Intrinsic Simulations between Stochastic Cellular Automata

The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochastic settings. We then provide explicit tools to prove or disprove the existence of such a simulation between two stochastic cellular automata, even though the intrinsic simulation relation is shown to be undecidable in dimension two and higher. The key result behind this is the caracterization of equality of stochastic global maps by the existence of a coupling between the random sources. We then prove that there is a universal non-deterministic cellular automaton, but no universal stochastic cellular automaton. Yet we provide stochastic cellular automata achieving optimal partial universality.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249

Bulking II: Classifications of Cellular Automata

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation between cellular automata and study the quasi-order structures induced by these simulation relations on the whole set of cellular automata. Various aspects of these quasi-orders are considered (induced equivalence relations, maximum elements, induced orders, etc) providing several formal tools allowing to classify cellular automata

Communication Complexity and Intrinsic Universality in Cellular Automata

The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce necessary conditions for a cellular automaton to be "universal", according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. This notion of simulation relies on simple operations of space-time rescaling and it is intrinsic to the model of cellular automata. Intrinsinc universality, the derived notion, is stronger than Turing universality, but more uniform, and easier to define and study. Our approach builds upon the notion of communication complexity, which was primarily designed to study parallel programs, and thus is, as we show in this article, particulary well suited to the study of cellular automata: it allowed to show, by studying natural problems on the dynamics of cellular automata, that several classes of cellular automata, as well as many natural (elementary) examples, could not be intrinsically universal

MODELLING SEGREGATION THROUGH CELLULAR AUTOMATA: A THEORETICAL ANSWER

This paper is a note in which we prove that Cellular Automata are suitable tools to model multi-agent interactive procedures. In particular, we apply the argument to validate results from simulation tools obtained for the classical model of segregation of Thomas Schelling (1971a).Cellular Automata, segregation, local information

Exploring Ancient Architectural Designs with Cellular Automata\ud

The paper discusses the utilization of three-dimensional cellular automata employing the two-dimensional totalistic cellular automata to simulate how simple rules could emerge a highly complex architectural designs of some Indonesian heritages. A detailed discussion is brought to see the simple rules applied in Borobudur Temple, the largest ancient Buddhist temple in the country with very complex detailed designs within. The simulation confirms some previous findings related to measurement of the temple as well as some other ancient buildings in Indonesia. This happens to open further exploitation of the explanatory power presented by cellular automata for complex architectural designs built by civilization not having any supporting sophisticated tools, even standard measurement systems

The Effect of Integrating Travel Time

This contribution demonstrates the potential gain for the quality of results in a simulation of pedestrians when estimated remaining travel time is considered as a determining factor for the movement of simulated pedestrians. This is done twice: once for a force-based model and once for a cellular automata-based model. The results show that for the (degree of realism of) simulation results it is more relevant if estimated remaining travel time is considered or not than which modeling technique is chosen -- here force-based vs. cellular automata -- which normally is considered to be the most basic choice of modeling approach.Comment: preprint of Pedestrian and Evacuation 2012 conference (PED2012) contributio

Counterflow Extension for the F.A.S.T.-Model

The F.A.S.T. (Floor field and Agent based Simulation Tool) model is a microscopic model of pedestrian dynamics, which is discrete in space and time. It was developed in a number of more or less consecutive steps from a simple CA model. This contribution is a summary of a study on an extension of the F.A.S.T-model for counterflow situations. The extensions will be explained and it will be shown that the extended F.A.S.T.-model is capable of handling various counterflow situations and to reproduce the well known lane formation effect.Comment: Contribution to Crowds and Cellular Automata Workshop 2008. Accepted for publication in "Cellular Automata -- 8th International Conference on Cellular Automata for Research and Industry, ACRI 2008, Yokohama, Japan, September 23-26, Springer 2008, Proceedings