Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets
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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Fan, Donglei Tarraf, Danielle C |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.1510.04209 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1510_04209</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1510_04209</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-a3acf97557b1cd867d40b4027316ad73cf6dc3653dccd23ddd489724d2956cfd3</originalsourceid><addsrcrecordid>eNotj81OAjEYRbthYdAHcGVfYLDT3-kSiChxEhbietLp14YmM2XSFpW3F5HVTU5yT3IQeqzJgjdCkGeTfsLXohYXQDgl-g69b0IMxeHPGPwxjXgVchhPgynhGDO-INyG6EzCH-dc3JjxdygHfDtt43QqeDlMB9O7ku_RzJshu4fbztF-87Jfv1Xt7nW7XraVkUpXhhnrtRJC9bWFRirgpOeEKlZLA4pZL8EyKRhYC5QBAG-0ohyoFtJ6YHP09K-91nRTCqNJ5-6vqrtWsV_RXkhJ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets</title><source>arXiv.org</source><creator>Fan, Donglei ; Tarraf, Danielle C</creator><creatorcontrib>Fan, Donglei ; Tarraf, Danielle C</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.1510.04209</identifier><language>eng</language><subject>Computer Science - Systems and Control ; Mathematics - Optimization and Control</subject><creationdate>2015-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1510.04209$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1510.04209$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Fan, Donglei</creatorcontrib><creatorcontrib>Tarraf, Danielle C</creatorcontrib><title>Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets</title><description>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.</description><subject>Computer Science - Systems and Control</subject><subject>Mathematics - Optimization and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81OAjEYRbthYdAHcGVfYLDT3-kSiChxEhbietLp14YmM2XSFpW3F5HVTU5yT3IQeqzJgjdCkGeTfsLXohYXQDgl-g69b0IMxeHPGPwxjXgVchhPgynhGDO-INyG6EzCH-dc3JjxdygHfDtt43QqeDlMB9O7ku_RzJshu4fbztF-87Jfv1Xt7nW7XraVkUpXhhnrtRJC9bWFRirgpOeEKlZLA4pZL8EyKRhYC5QBAG-0ohyoFtJ6YHP09K-91nRTCqNJ5-6vqrtWsV_RXkhJ</recordid><startdate>20151014</startdate><enddate>20151014</enddate><creator>Fan, Donglei</creator><creator>Tarraf, Danielle C</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20151014</creationdate><title>Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets</title><author>Fan, Donglei ; Tarraf, Danielle C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-a3acf97557b1cd867d40b4027316ad73cf6dc3653dccd23ddd489724d2956cfd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Systems and Control</topic><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Fan, Donglei</creatorcontrib><creatorcontrib>Tarraf, Danielle C</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fan, Donglei</au><au>Tarraf, Danielle C</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets</atitle><date>2015-10-14</date><risdate>2015</risdate><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.</abstract><doi>10.48550/arxiv.1510.04209</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1510.04209 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1510_04209 |
| source | arXiv.org |
| subjects | Computer Science - Systems and Control Mathematics - Optimization and Control |
| title | Finite Uniform Bisimulations for Linear Systems with Finite Input Alphabets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T12%3A51%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Finite%20Uniform%20Bisimulations%20for%20Linear%20Systems%20with%20Finite%20Input%20Alphabets&rft.au=Fan,%20Donglei&rft.date=2015-10-14&rft_id=info:doi/10.48550/arxiv.1510.04209&rft_dat=%3Carxiv_GOX%3E1510_04209%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |