UNIVERSI
TÄ
TS-
BIBLIOTHEK
P
ADERBORN
Anmelden
Menü
Menü
Start
Hilfe
Blog
Weitere Dienste
Neuerwerbungslisten
Fachsystematik Bücher
Erwerbungsvorschlag
Bestellung aus dem Magazin
Fernleihe
Einstellungen
Sprache
Deutsch
Deutsch
Englisch
Farbschema
Hell
Dunkel
Automatisch
Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist
gegebenenfalls
nur via VPN oder Shibboleth (DFN-AAI) möglich.
mehr Informationen...
Universitätsbibliothek
Katalog
Suche
Details
Zur Ergebnisliste
Datensatz exportieren als...
BibTeX
Safe & robust reachability analysis of hybrid systems
Theoretical computer science, 2018, Vol.747, p.75
Moggi, E.
Farjudian, A.
Duracz, Adam
Taha, Walid
2018
Volltextzugriff (PDF)
Details
Autor(en) / Beteiligte
Moggi, E.
Farjudian, A.
Duracz, Adam
Taha, Walid
Titel
Safe & robust reachability analysis of hybrid systems
Ist Teil von
Theoretical computer science, 2018, Vol.747, p.75
Erscheinungsjahr
2018
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
Hybrid systems—more precisely, their mathematical models—can exhibit behaviors, like Zeno behaviors, that are absent in purely discrete or purely continuous systems. First, we observe that, in this context, the usual definition of reachability—namely, the reflexive and transitive closure of a transition relation—can be unsafe, i.e., it may compute a proper subset of the set of states reachable in finite time from a set of initial states. Therefore, we propose safe reachability, which always computes a superset of the set of reachable states. Second, in safety analysis of hybrid and continuous systems, it is important to ensure that a reachability analysis is also robust w.r.t. small perturbations to the set of initial states and to the system itself, since discrepancies between a system and its mathematical models are unavoidable. We show that, under certain conditions, the best Scott continuous approximation of an analysis A is also its best robust approximation. Finally, we exemplify the gap between the set of reachable states and the supersets computed by safe reachability and its best robust approximation. © 2018 The Authors
Sprache
Englisch
Identifikatoren
ISSN: 0304-3975, 1879-2294
DOI: 10.1016/j.tcs.2018.06.020
Titel-ID: cdi_swepub_primary_oai_DiVA_org_hh_38699
Format
–
Schlagworte
Computational methods
,
Computer science
,
Continuous approximations
,
Domain theory
,
Hybrid systems
,
Reachability
,
Reachability analysis
,
Robust approximations
,
Robustness (control systems)
,
Small perturbations
,
Transition relations
,
Transitive closure
Weiterführende Literatur
Empfehlungen zum selben Thema automatisch vorgeschlagen von
bX