Checking Algebraic Reachability of Polynomial and Rational Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F17%3A43915180" target="_blank" >RIV/60461373:22340/17:43915180 - isvavai.cz</a>
Result on the web
<a href="https://ac.els-cdn.com/S2405896317328136/1-s2.0-S2405896317328136-main.pdf?_tid=spdf-03836b32-339d-4d08-b70e-e53db3338a88&acdnat=1519813961_d666f26c67c4c549dde1b889391a829e" target="_blank" >https://ac.els-cdn.com/S2405896317328136/1-s2.0-S2405896317328136-main.pdf?_tid=spdf-03836b32-339d-4d08-b70e-e53db3338a88&acdnat=1519813961_d666f26c67c4c549dde1b889391a829e</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ifacol.2017.08.2144" target="_blank" >10.1016/j.ifacol.2017.08.2144</a>

Result language
angličtina
Original language name
Checking Algebraic Reachability of Polynomial and Rational Systems
Original language description
The overview of possible approaches to check algebraic reachability of polynomial and rational systems is provided. The respective methods are demonstrated on a number of examples chosen with the emphasis on tutorial presentation of the results and on applications.
Czech name
—
Czech description
—

Project
<a href="/en/project/GP13-16764P" target="_blank" >GP13-16764P: Observability of semi-algebraic systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Result description