A control theory for Boolean monomial dynamical systems
A monomial boolean dynamical system is a map \(f:\mathbb F_2^n\to\mathbb F_2^n\) given by \(n\) monomials \(f_1,\dots,f_n\) in the \(n\) variables (with the assumption that no \(f_i\) is a constant). Here a directed graph is associated to such a map, and a result of \textit{O. Colón--Reyes} et al. [Complex Syst. 16, No. 4, 333--342 (2007; Zbl 1167.37320)] is used to characterize in graph-theoretic terms the property that \(f\) is a `fixed-point system', in which the system ends up on a fixed point. Here ideas from control theory are used to find a novel \(O(n^2\log n)\) algorithm to determine when \(f\) is a fixed-point system. These discrete dynamical systems are used in diverse areas including mathematical biology.
- Boolean monomial dynamical systems
- The number of fixed points of AND-OR networks with chain topology
- On persistent excitations for the identification of switched linear dynamical systems over finite fields
- Determining steady state behaviour of discrete monomial dynamical systems
- Matrix representations of vectorial Boolean functions and eigenanalysis
- Boolean monomial control systems
- Structure and dynamics of acyclic networks
- A Nonsmooth Approach to Controller Synthesis for Boolean Specifications
- An algebraic and graph theoretic framework to study monomial dynamical systems over a finite field
- On the transient of Boolean monomial dynamical systems
This page was built for publication: A control theory for Boolean monomial dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962028)
