Current Challenges in the Verification of Hybrid Systems

Schupp, Stefan; Ábrahám, Erika; Chen, Xin; Makhlouf, Ibtissem Ben; Frehse, Goran; Sankaranarayanan, Sriram; Kowalewski, Stefan

doi:10.1007/978-3-319-25141-7_2

Cited by 26 publications

(9 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hybrid automata [6] can be analyzed by a number of methods [45]. These range from SMT [19,25,36], deduction [43], level sets [41], and simulation [24] based to flow-pipe construction based methods.…”

Section: Related Workmentioning

confidence: 99%

Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata

Bak

Bogomolov

Althoff

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A promising technique for the formal verification of embedded and cyber-physical systems is flow-pipe construction, which creates a sequence of regions covering all reachable states over time. Flow-pipe construction methods can check whether specifications are met for all states, rather than just testing using a finite and incomplete set of simulation traces. A fundamental challenge when using flow-pipe construction on high-dimensional systems is the cost of geometric operations, such as intersection and convex hull. We address this challenge by showing that it is often possible to remove the need to perform high-dimensional geometric operations by combining two model transformations, direct time-triggered conversion and dynamics scaling. Further, we prove the overapproximation error in the conversion can be made arbitrarily small. Finally, we show that our transformation-based approach enables the analysis of a drivetrain system with up to 51 dimensions.

show abstract

Section: Related Workmentioning

confidence: 99%

Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata

Bak

Bogomolov

Althoff

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Figure 4 describes the typical verification workflow using model checking techniques, where a set of system properties are checked against a formal system model in order to ensure correct global system behavior. The idea behind verification of the IoMT is the reachability analysis of the different states described in the hybrid model [32]. To perform verification of IoMT models, several tools and algorithms were developed for hybrid state machine models [32], [35] or for Petri net derived models [34].…”

mentioning

confidence: 99%

“…The idea behind verification of the IoMT is the reachability analysis of the different states described in the hybrid model [32]. To perform verification of IoMT models, several tools and algorithms were developed for hybrid state machine models [32], [35] or for Petri net derived models [34]. Generic verification tools targeting distributed architecture were also developed [33].…”

mentioning

confidence: 99%

Internet of Medical Things: A Review of Recent Contributions Dealing With Cyber-Physical Systems in Medicine

Gatouillat

Badr

Massot

et al. 2018

IEEE Internet Things J.

312

140

View full text Add to dashboard Cite

The Internet of Medical Things designates the interconnection of communication-enabled medical-grade devices and their integration to wider-scale health networks in order to improve patients' health. However, because of the critical nature of health-related systems, the Internet of Medical Things still faces numerous challenges, more particularly in terms of reliability, safety and security. In this paper, we present a comprehensive literature review of recent contributions focused on improving the Internet of Medical Things through the use of formal methodologies provided by the cyber-physical systems community. We describe the practical application of the democratization of medical devices for both patients and health-care providers. We also identify unexplored research directions and potential trends to solve uncharted research problems.

show abstract

“…One of the most frequently used technique for analyzing hybrid systems is reachability analysis [27]. A variety of tools have been developed that can perform reachability analysis as listed in the references of e.g.…”

Section: Introductionmentioning

confidence: 99%

“…A variety of tools have been developed that can perform reachability analysis as listed in the references of e.g. [2,5,6,11,17,27]. Our tool COntinuous Reachability Analyzer (CORA) [4] realizes techniques for reachability analysis with a special focus on developing scalable solutions for verifying hybrid systems with nonlinear continuous dynamics.…”

Section: Introductionmentioning

confidence: 99%

Implementation of Interval Arithmetic in CORA 2016

Althoff¹,

Grebenyuk²

EPiC Series in Computing

View full text Add to dashboard Cite

Interval arithmetic can be seen as one of the workhorses for formal verification approaches. The popularity of interval arithmetic stems from the fact that the possible outcomes of almost all frequently occurring mathematical expressions can be bounded. A disadvantage of interval arithmetic is that due to the negligence of dependencies of variables in expressions, results can be overly conservative. For this reason, interval arithmetic is typically used in formal verification tools when formulas are not contributing much to the accuracy of the overall approach, but do not belong to a restrictive class of expressions and are thus hard to evaluate. Although a lot of textbooks and software manuals for interval arithmetic exist, we have not found a complete and detailed description of how all standard mathematical functions are evaluated. This work changes this situation and describes concisely the evaluation of all standard mathematical functions. The described techniques are implemented as a class in CORA, a free MATLAB tool for continuous reachability analysis. Previously, CORA used the MATLAB toolbox INTLAB, but this tool is no longer freely available. Thus, our interval arithmetic class is currently the only freely available implementation of interval arithmetic that runs under current MATLAB versions. We have thoroughly tested our implementation against INTLAB and present the results.

show abstract

Current Challenges in the Verification of Hybrid Systems

Cited by 26 publications

References 24 publications

Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata

Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata

Internet of Medical Things: A Review of Recent Contributions Dealing With Cyber-Physical Systems in Medicine

Implementation of Interval Arithmetic in CORA 2016

Contact Info

Product

Resources

About