HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Discrétisation automatique de machines à signaux en automates cellulaires

Abstract : In the context of abstract geometrical computation, signal machines have been developed as a continuous counter part of cellular automata capturing the notions of particles, signals and collisions. An important issue is the automatic generation of a cellular automaton mimicking the dynamics of a given signal machine. On the one hand, ad hoc conversions exist.On the other hand, it is not always possible since some signal machines exhibit “purely continuous” behaviors. Therefore, automatically discretizing such structures is often complicated and not always possible. This thesis proposes different ways to automatically discretize signal machines into cellular automata, both with and without handling the possiblity of approximation.The first is concerned with a subcategory of signal machines, which has properties ensuring an exact automatic discretization for any machine of this type. The second is usable on all machines but cannot guarantee the exactness and correction of the result. The third is based on a new expression of the dynamics of a signal machine to propose a discretization.This dynamical expression takes the name of modularity and is described before being used to discretize.
Document type :
Complete list of metadata

Cited literature [55 references]  Display  Hide  Download

Contributor : Abes Star :  Contact
Submitted on : Wednesday, January 9, 2019 - 3:45:08 PM
Last modification on : Monday, April 25, 2022 - 3:57:09 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01975875, version 1


Tom Besson. Discrétisation automatique de machines à signaux en automates cellulaires. Autre [cs.OH]. Université d'Orléans, 2018. Français. ⟨NNT : 2018ORLE2009⟩. ⟨tel-01975875⟩



Record views


Files downloads