Abstract
This paper investigates three kinds of system decompositions of multi-valued Boolean control networks. Based on the algebraic representation of Boolean control networks, some necessary and sufficient graphical conditions for the decomposability are proposed and consequently the system decomposition problems are completely solved. It is revealed that not every Boolean control system has a Kalman decomposition.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
