Pure Mathematics
2009-12-01
2019-04-11T10:02
http://link.springer.com/10.1134/S001226610912009X
1783-1790
2009-12
en
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.
false
https://scigraph.springernature.com/explorer/license/
Linear stationary control systems over a Boolean semiring: Geometric properties and the isomorphism problem
research_article
articles
F. S.
Vainshtein
Georgia Institute of Technology, Atlanta, USA
Georgia Institute of Technology
Russian State University of Oil and Gas, Moscow, Russia
N. I.
Osetinskii
Vasil’ev
O. O.
12
Differential Equations
0374-0641
0012-2661
doi
10.1134/s001226610912009x
dimensions_id
pub.1045300756
readcube_id
d7c8f9a281c7c3e17125a949ef1394d18d2d04bb0ef1c558d7000bc8d1861b15
Mathematical Sciences
45
Springer Nature - SN SciGraph project