English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a class of systems over finite alphabets, namely discrete-timesystems with linear dynamics and a finite input alphabet. We formulate a notionof finite uniform bisimulation, and motivate and propose a notion of regularfinite uniform bisimulation. We derive sufficient conditions for the existenceof finite uniform bisimulations, and propose and analyze algorithms to computefinite uniform bisimulations when the sufficient conditions are satisfied. Weinvestigate the necessary conditions, and conclude with a set of illustrativeexamples.

Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets