Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets

DOI10.1109/TAC.2017.2679901MaRDI QIDQ4589482zbMATH OpenOpenAlexFDO

Authors Donglei Fan, D. C. Tarraf

Publication date 10 November 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.04209

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Cited in

(2)

• On robust stability of switched systems in the context of Filippov solutions
• Bisimulation Finiteness of Pushdown Systems Is Elementary

This page was built for publication: Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589482)