On existence and construction of finite uniform bisimulations for linear systems with finite input alphabets

Fan, Donglei; Tarraf, Danielle C.

doi:10.1109/cdc.2015.7402348

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we revisit the question of existence of finite state equivalent models (a preliminary version of this work appeared in [5]), focusing on a special class of systems over finite alphabets, namely systems with linear dynamics and finite input alphabets. This class of systems provides potential models of simple practical systems where the actuation involves multi-level switching.…”

Section: Introductionmentioning

confidence: 99%

Finite Uniform Bisimulations for Linear Systems With Finite Input Alphabets

Fan

Tarraf

2017

IEEE Trans. Automat. Contr.

Self Cite

View full text Add to dashboard Cite

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.Index Terms-finite uniform bisimulations, systems over finite alphabets, abstractions.

show abstract

Section: Introductionmentioning

confidence: 99%