Linear stationary control systems over the Boolean semiring and their graphs of modules

Abstract

We consider linear stationary dynamical systems over the Boolean semiring. We analyze the properties of complete observability, identifiability, attainability, and controllability of a system. We define the notion of the “graph of modules” of totally controllable totally attainable Boolean linear stationary systems by analogy with spaces of modules in the case of systems over fields. The above-mentioned graph is described in the simplest case of one-dimensional inputs and outputs. We prove the weak connectedness of this oriented graph.