Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets
From MaRDI portal
Publication:4589482
DOI10.1109/TAC.2017.2679901zbMath1373.93145arXiv1510.04209OpenAlexW2963053577MaRDI QIDQ4589482
Publication date: 10 November 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Abstract: We consider a class of systems over finite alphabets, namely discrete-time systems with linear dynamics and a finite input alphabet. We formulate a notion of finite uniform bisimulation, and motivate and propose a notion of regular finite uniform bisimulation. We derive sufficient conditions for the existence of finite uniform bisimulations, and propose and analyze algorithms to compute finite uniform bisimulations when the sufficient conditions are satisfied. We investigate the necessary conditions, and conclude with a set of illustrative examples.
Full work available at URL: https://arxiv.org/abs/1510.04209
Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
This page was built for publication: Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets
