Premium
Assume–guarantee verification of nonlinear hybrid systems with Ariadne
Author(s) -
Benvenuti Luca,
Bresolin Davide,
Collins Pieter,
Ferrari Alberto,
Geretti Luca,
Villa Tiziano
Publication year - 2012
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.2914
Subject(s) - reachability , undecidable problem , hybrid system , computer science , exploit , nonlinear system , set (abstract data type) , theoretical computer science , formal verification , decidability , programming language , physics , computer security , quantum mechanics , machine learning
SUMMARY In many applicative fields, there is the need to model and design complex systems having a mixed discrete and continuous behavior that cannot be characterized faithfully using either discrete or continuous models only. Such systems consist of a discrete control part that operates in a continuous environment and are named hybrid systems because of their mixed nature. Unfortunately, most of the verification problems for hybrid systems, like reachability analysis, turn out to be undecidable. Because of this, many approximation techniques and tools to estimate the reachable set have been proposed in the literature. However, most of the tools are unable to handle nonlinear dynamics and constraints and have restrictive licenses. To overcome these limitations, we recently proposed an open‐source framework for hybrid system verification, called Ariadne , which exploits approximation techniques based on the theory of computable analysis for implementing formal verification algorithms. In this paper, we will show how the approximation capabilities of Ariadne can be used to verify complex hybrid systems, adopting an assume–guarantee reasoning approach. Copyright © 2012 John Wiley & Sons, Ltd.