The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2017 IEEE Real-Time Systems Symposium (RTSS) 2017
DOI: 10.1109/rtss.2017.00035
|View full text |Cite
|
Sign up to set email alerts
|

Model Predictive Real-Time Monitoring of Linear Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 21 publications
0
19
0
Order By: Relevance
“…A number of methods have been proposed for online reachability analysis that rely on separating the reachability computation into distinct offline and online phases. However, these methods are limited to restricted classes of models [10], or require handcrafted optimization of the HA's derivatives [4], or are efficient only for low-dimensional systems and simple dynamics [25]. In contrast, NSC [21] is based on learning DNN-based classifiers, is fully automated and has negligible computational cost at runtime.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…A number of methods have been proposed for online reachability analysis that rely on separating the reachability computation into distinct offline and online phases. However, these methods are limited to restricted classes of models [10], or require handcrafted optimization of the HA's derivatives [4], or are efficient only for low-dimensional systems and simple dynamics [25]. In contrast, NSC [21] is based on learning DNN-based classifiers, is fully automated and has negligible computational cost at runtime.…”
Section: Related Workmentioning
confidence: 99%
“…Our focus is on the online analysis of hybrid systems and, in particular, on the predictive monitoring (PM) problem [10]; i.e., the problem of predicting, at runtime, whether or not an unsafe state can be reached from the current system state within a given time bound. PM is at the core of architectures for runtime safety assurance such as Simplex [26], where the system switches to a safe fallback mode whenever PM indicates the potential for an imminent failure.…”
Section: Introductionmentioning
confidence: 99%
“…Even though research on reachability checking of hybrid systems [13,1] has produced effective verification algorithms and tools [10,7,11], comparably little has been done to make these algorithms efficient for online analysis. Existing approaches are limited to restricted classes of models [8], or require handcrafted optimization of the HA's derivatives [2], or are efficient only for low-dimensional systems and simple dynamics [21]. NSC [19] (introduced in Section 2) overcomes these limitations because, by employing machine learning models, it is fully automated and its performance is not affected by the model size or complexity.…”
Section: Related Workmentioning
confidence: 99%
“…Note CORA Since the dynamics of this example is dominated by the input after one second, we use the step size 0.002 for t ∈ [0, 1] and the step size 0.01 for t ∈ [1,20]. The zonotope order is chosen as 100. .…”
Section: Resultsmentioning
confidence: 99%
“…Unlike convex set representations, symbolic flowpipes are usually more time-costly to obtain, however, they are only ODE related and can be directly reused in a safety verification task, i.e., with a different initial set or unsafe condition. Besides, symbolic flowpipes can be used in generating relational abstractions [30,19] and real-time monitoring [20] for dynamical systems. In the current version, Flow* simply treats all real numbers as intervals in order to take roundoff errors into account in all computational tasks.…”
Section: Participating Toolsmentioning
confidence: 99%