Skip to Main content Skip to Navigation

Simulation entre modèles de calcul naturel et modularité des réseaux d'automate

Abstract : We explore different generalisations about natural computation models. The most theoretical is the notion of simulation between models, for which we describe a series of proposed definitions, by discussing the interests and the flaws of each of them. We take advantage of the most promising definitions to broaden the discussion on the possible consequences of simulation in complexity theory, such as the construction of new complexity classes by proposing the substitution of polynomial reduction by simulation. Our more applied approach consists in the generalisation of automata networks by means of modules that have inputs. This formalism makes it possible to approach the questions of the dynamics of interaction networks from a new angle : we explore its usefulness as a modular tool capable of flexibly simulating many similar objects, as well as the expressiveness of acyclic modules. These allow the characterisation of the dynamics of automata networks in the form of output functions. This expressiveness allows us to describe a process for optimising automata networks that reduces certain networks in size while retaining equivalent attractors.
Document type :
Complete list of metadata
Contributor : Pacôme PERROTIN Connect in order to contact the contributor
Submitted on : Saturday, April 10, 2021 - 1:15:36 PM
Last modification on : Tuesday, October 19, 2021 - 10:59:50 PM
Long-term archiving on: : Monday, July 12, 2021 - 9:25:16 AM


Files produced by the author(s)


  • HAL Id : tel-03188307, version 1



Pacôme Perrotin. Simulation entre modèles de calcul naturel et modularité des réseaux d'automate. Informatique [cs]. Aix-Marseile Université, 2021. Français. ⟨tel-03188307⟩



Record views


Files downloads