9 research outputs found
Does Life resist asynchrony ?
We study Conway's Game of Life with an asynchronous updating
Multi-level agent-based modeling with the Influence Reaction principle
This paper deals with the specification and the implementation of multi-level
agent-based models, using a formal model, IRM4MLS (an Influence Reaction Model
for Multi-Level Simulation), based on the Influence Reaction principle.
Proposed examples illustrate forms of top-down control in (multi-level)
multi-agent based-simulations
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
Robustness of Cellular Automata in the Light of Asynchronous Information Transmission
International audienceCellular automata are classically synchronous: all cells are simultaneously updated. However, it has been proved that perturbations in the updating scheme may induce qualitative changes of behaviours. This paper presents a new type of asynchronism, the beta -synchronism, where cells still update at each time step but where the transmission of information between cells is disrupted randomly. We experimentally study the behaviour of beta-synchronous models. We observe that, although many eff ects are similar to the perturbation of the update, novel phenomena occur. We particularly study phase transitions as an illustration of a qualitative variation of behaviour triggered by continuous change of the disruption probability beta
Robustness of multi-agent models: the example of collaboration between turmites with synchronous and asynchronous updating
International audienceThe robusntess of multi-agent systems to simulation conditions is analysed through a precise example, invented by Langton to investigate the foundations of artificial life. This system is composed of simple and memoryless agents, the turmites, which obey simple discrete local rules. While the local rules that govern each agent are kept constant, the interaction between agents are modified through nine variations. Our method consists in varying the updating scheme (synchronous vs. asynchronous) and the local conflict resolution policy (strong or weak exclusion rules). We experimentally estimate the effect of these modifications on three collaborative phenomena. We also analyse how the dynamics at the microscopic scale reflects the robustness of the system at the macroscopic scale. Observations confirm that the definition of the agents' behaviour is not the only setting that matters in the emergence of collaborative phenomena in complex systems: the way the agents are updated is also a key choice
First steps on asynchronous lattice-gas models with an application to a swarming rule
International audienceLattice-gas cellular automata are often considered as a particular case of cellular automata in which additional constraints apply, such as conservation of particles or spatial exclusion. But what about their updating? How to deal with non-perfect synchrony? Novel definitions of asynchronism are proposed that respect the specific hypotheses of lattice-gas models. These definitions are then applied to a swarming rule in order to explore the robustness of the global emergent behaviour. In particular, we compare the synchronous and asynchronous case, and remark that anti-alignment of particles is no longer observed when a small critical amount of asynchronism is added
Recommended from our members
Symmetry and Historicity in the Game of Life: Modifying Rules to Simulate Evolutionary Dynamics
The Game of Life (GoL) is a paradigmatic computer simulation that exhibits the emergence of complex properties of the whole from relatively simple sets of heuristic rules operating at lower organizational levels. Therefore, it is widely understood as a valuable tool for investigating global properties of evolutionary processes. Cognizant of refined concepts that emerged in recent debates on the central role of historical contingency (historicity) in evolution, we modify the original GoL rules by introducing an updating feedback loop and a probability factor that reflect the degree of historicity in pattern evolution as both stochastic path dependence and sensitivity to initial conditions. We examine this trait in simulations of the emergence and breaking of bilateral and radial symmetries commonly observed in the evolution of life, most prominently as evolving body plans. We show that the implementation of historicity parameters leads to a more realistic sequential and gradual alternating emergence and the breaking of new symmetries than the original set of rules. Apart from its more realistic representations of evolutionary processes, the new approach allows for easier exploration of the parameter space, demonstrates the sequential and gradual emergence and breaking of symmetries, and provides a publicly available and modular simulation tool. We discuss the exploratory potential of the modified GoL platform we designed as an extended thought experiment to study the parameter space defining the historicity of biological processes
Probing robustness of cellular automata through variations of asynchronous updating
International audienceTypically viewed as a deterministic model of spatial computing, cellular automata are here considered as a collective system subject to the noise inherent to natural computing. The classical updating scheme is replaced by stochastic versions which either randomly update cells or disrupt the cell-to-cell transmission of information. We then use the novel updating schemes to probe the behaviour of Elementary Cellular Automata, and observe a wide variety of results. We study these behaviours in the scope of macroscopic statistical phenomena and microscopic analysis. Finally, we discuss the possibility to use updating schemes to probe the robustness of complex systems
Asynchronous cellular automata
This text has been proposed for the Encyclopedia of Complexity and Systems Science edited by Springer Nature and should appear in 2018.International audienceThis text is intended as an introduction to the topic of asynchronous cellular automata. We start from the simple example of the Game of Life and examine what happens to this model when it is made asynchronous (Sec. 1). We then formulate our definitions and objectives to give a mathematical description of our topic (Sec. 2). Our journey starts with the examination of the shift rule with fully asynchronous updating and from this simple example, we will progressively explore more and more rules and gain insights on the behaviour of the simplest rules (Sec. 3). As we will meet some obstacles in having a full analytical description of the asynchronous behaviour of these rules, we will turn our attention to the descriptions offered by statistical physics, and more specifically to the phase transition phenomena that occur in a wide range of rules (Sec. 4). To finish this journey, we will discuss the various problems linked to the question of asynchrony (Sec. 5) and present some openings for the readers who wish to go further (Sec. 6)