Abstract
In the present paper, we consider linear stationary dynamical systems over a Boolean semiring B. We analyze the complete observability, identifiability, reachability, and controllability of such systems. We define the notion of a “graph of modules” of completely controllable, completely reachable Boolean linear stationary systems by analogy with the spaces of modules in the case of systems over fields. We give a graph-theoretic interpretation of systems of this class. We solve the isomorphism problem in this class of systems.
Sign-in/Register to access full text options 
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.
