Abstract
ABSTRACT Boolean Networks can be converted to discrete linear dynamical systems on finite spaces by a semi-tensor-product approach. This approach has been used by many to study the dynamics and control of Boolean systems. However, the process of getting the linear representation using the semi-tensor-product method is complicated even for a simple three-node network and requires the help of a computer program. In this work, we show that we can skip the semi-tensor process and obtain the same linear representation with a straightforward mapping. Moreover, our approach produces a large number of isomorphic representations which provides a flexible framework. Importantly, it could simplify the analytical study of networks with unspecified number of nodes that have some structure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have