Intrinsic Universality in Automata Networks III: On Symmetry versus Asynchrony - Archive ouverte HAL
Journal Articles Theoretical Computer Science Year : 2024

Intrinsic Universality in Automata Networks III: On Symmetry versus Asynchrony

Abstract

An automata network is a finite assembly of interconnected entities endowed with a set of local maps defined over a common finite alphabet. These relationships are represented through an interaction graph. Together with the local functions, an assignment known as an update scheme directs the evolution of the network by updating specific subsets of entities at discrete time steps. Despite the scrutiny of interaction graphs and update schemes, their profound impact on automata network dynamics remains largely open. This work investigates the intricate interplay between these aspects, with a focus on how update schemes can counterbalance constraints stemming from symmetric local interactions. This paper is the third of a series about intrinsic universality, a notion that assesses both dynamical and computational complexity, encompassing transient behaviors, attractors, and prediction or reachability problems. We consider four update modes—parallel, block-sequential, local clocks, and general periodic— along with several families of symmetric signed conjunctive boolean networks defined by local constraints on signs. Our main result is to show a diagonal complexity leap in this two-dimensional landscape: the stronger the local constraints the higher the level of asynchrony required to obtain intrinsic universality or increase in complexity. We also show how in some cases asynchronism allows to simulate directed interactions from undirected ones with the same local rules.
Fichier principal
Vignette du fichier
TCS.pdf (494.99 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03225820 , version 1 (13-05-2021)
hal-03225820 , version 2 (08-09-2023)
hal-03225820 , version 3 (21-10-2024)

Licence

Identifiers

Cite

Martín Ríos Wilson, Guillaume Theyssier. Intrinsic Universality in Automata Networks III: On Symmetry versus Asynchrony. Theoretical Computer Science, 2024, ⟨10.1016/j.tcs.2024.114890⟩. ⟨hal-03225820v3⟩
110 View
106 Download

Altmetric

Share

More