Back to Search
Start Over
Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets.
- Source :
-
IEEE Transactions on Automatic Control . Aug2017, Vol. 62 Issue 8, p4144-4150. 7p. - Publication Year :
- 2017
-
Abstract
- We consider discrete-time systems with linear dynamics and a finite input alphabet. We propose a sufficient condition for the existence of finite uniform bisimulations, and an algorithm that terminates when the condition holds and constructs the corresponding equivalence classes. We derive a stronger sufficient condition for the construction of arbitrarily many equivalence classes, together with a corresponding constructive algorithm. Finally, we derive a necessary condition for the existence of finite uniform bisimulations. All our conditions are topological in nature. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 62
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 124331682
- Full Text :
- https://doi.org/10.1109/TAC.2017.2679901