A graph theory approach for regional controllability of Boolean cellular automata. Issue 5 (2nd September 2020)

• Record Type: Journal Article
• Authors: Dridi, S.; El Yacoubi, S.; Bagnoli, F.; Fontaine, A.
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 35:Issue 5(2020)
• Page Start: 499
• Page End: 513
• Publication Date: 2020-09-02
• Subjects: Regional controllability -- deterministic cellular automata -- graph theory -- Hamiltonian circuit -- strongly connected component; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2019.1608442
• Languages: English
• ISSNs: 1744-5760

Abstract

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. GRAPHICAL ABSTRACT: