Safe & robust reachability analysis of hybrid systems

Eugenio Moggi, Amin Farjudian, Adam Duracz, Walid Taha

Research output: Journal PublicationArticlepeer-review

6 Citations (Scopus)
1 Downloads (Pure)

Abstract

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.

Original languageEnglish
Pages (from-to)75-99
Number of pages25
JournalTheoretical Computer Science
Volume747
DOIs
Publication statusPublished - 7 Nov 2018

Keywords

  • Domain theory
  • Hybrid systems
  • Reachability
  • Robustness

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Safe & robust reachability analysis of hybrid systems'. Together they form a unique fingerprint.

Cite this