LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Observability and reconstructibility of bounded cellular automata

Photo by kel_foto from unsplash

The aim of this article is to provide several ways to assess the observability and the reconstructibility of bounded cellular automata (CA). First, generic definitions for the considered CA and… Click to show full abstract

The aim of this article is to provide several ways to assess the observability and the reconstructibility of bounded cellular automata (CA). First, generic definitions for the considered CA and their associated sensors are given, as well as the definitions for observability and reconstructibility of these measured dynamical systems. Criteria of observability and reconstructibility are proposed for linear and affine CA through an extension of the Kalman criterion and for non-linear CA from an extension of the results on observability and reconstructibility of Boolean networks. A method for decentralised observability calculation is presented for non-linear CA in order to reduce the algorithmic complexity. These criteria are analyzed and illustrated through several examples, either with fixed or mobile sensors. Numerical methods and related complexity issues are discussed.

Keywords: reconstructibility bounded; observability reconstructibility; reconstructibility; cellular automata; bounded cellular

Journal Title: International Journal of Systems Science
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.