A graph theory approach for regional controllability of Boolean cellular automata - Archive ouverte HAL Access content directly
Journal Articles International Journal of Parallel, Emergent and Distributed Systems Year : 2019

A graph theory approach for regional controllability of Boolean cellular automata

(1, 2) , (3, 4) , (2) , (5)
1
2
3
4
5

Abstract

Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time interval. When the desired objective affects only a sub-region of the domain, the control is said to be regional. The purpose of this paper is to study a particular case of regional control using cellular automata models since they are spatially extended systems where spatial properties can be easily defined thanks to their intrinsic locality. We investigate the case of boundary controls on the target region using an original approach based on graph theory. Necessary and sufficient conditions are given based on the Hamiltonian circuit and strongly connected component. The controls are obtained using a preimage approach

Dates and versions

hal-02142983 , version 1 (29-05-2019)

Identifiers

Cite

Sara Dridi, Samira El Yacoubi, Franco Bagnoli, Allyx Fontaine. A graph theory approach for regional controllability of Boolean cellular automata. International Journal of Parallel, Emergent and Distributed Systems, 2019, ⟨10.1080/17445760.2019.1608442⟩. ⟨hal-02142983⟩
73 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More