Koopman Representation for Boolean Networks

Abstract

Boolean networks, as logical dynamical systems whose system states are Boolean variables, arise from applications in biology, computer networks, and social networks etc. The representation and control of Boolean networks have attracted a lot of attention in recent years. On a parallel line of research, Koopman developed an operator view of nonlinear dynamical systems in early 1930s, which shows that using observable functions all nonlinear dynamics can be represented as (infinite dimensional) linear systems. In this paper, we present a framework for representing Boolean networks via Koopman approach. First of all, we construct addition and scalar multiplication operations over the set of logical functions over the binary field, defining a linear Boolean function space. Then associated with any Boolean mapping, the induced Koopman operator is defined as an operator over such Boolean function space. Next, we show that if there exists a set of logical functions that are invariant in the Koopman sense, a Boolean network can be represented by a finite-dimensional linear system. This Koopman perspective for Boolean networks is also extended to controlled Boolean networks.