Benchmark: A Nonlinear Reachability Analysis Test Set from Numerical Analysis

نویسندگان

  • Hoang-Dung Tran
  • Luan Viet Nguyen
  • Taylor T. Johnson
چکیده

The field of numerical analysis has developed numerous benchmarks for evaluating differential and algebraic equation solvers. In this paper, we describe a set of benchmarks commonly used in numerical analysis that may also be effective for evaluating continuous and hybrid systems reachability and verification methods. Many of these examples are challenging and have highly nonlinear differential equations and upwards of tens of dimensions (state variables). Additionally, many examples in numerical analysis are originally encoded as differential algebraic equations (DAEs) with index greater than one or as implicit differential equations (IDEs), which are challenging to model as hybrid automata. We present executable models for ten benchmarks from a test set for initial value problems (IVPs) in the SpaceEx format (allowing for nonlinear equations instead of restricting to affine) and illustrate their conversion to several other formats (dReach, Flow*, and the MathWorks Simulink/Stateflow [SLSF]) using the HyST tool. For some instances, we present successful analysis results using dReach, Flow*, and SLSF. Category: academic Difficulty: low through challenge 1 Context and Origins Verification and validation are important tasks that are applied broadly in many fields in recent years such as embedded systems, power electronics, networked control systems, and aerospace systems [1–3]. Many different verification methods and tools have been developed for reachability analysis of hybrid systems [4–7]. The challenges in verification of continuous and hybrid systems are many, and include for example complex nonlinear dynamics, high-dimensional state-spaces, and bounded vs. unbounded time. To evaluate novel verification methods and tools, we need to evaluate and test them using a variety of diverse benchmarks, that are ideally standardized. However, these benchmarks are not ∗Computer Science and Engineering, University of Texas at Arlington — Arlington, TX

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Validating a Hamilton-Jacobi Approximation to Hybrid System Reachable Sets

We develop a general framework for solving the hybrid system reachability problem, and indicate how several published techniques fit into this framework. The key unresolved need of any hybrid system reachability algorithm is the computation of continuous reachable sets; consequently, we present new results on techniques for calculating numerical approximations of such sets evolving under genera...

متن کامل

Demonstrating Numerical Convergence to the Analytic Solution of some Backwards Reachable Sets with Sharp Features∗

We examine the convergence properties of a level set algorithm designed to track evolving interfaces; in particular, its convergence properies on a series of two and three dimensional backwards reachable sets whose flow fields involve kink formation (sharp features) and, in some cases, rarefaction fans introduced by input parameters in the dynamics. The chosen examples have analytic solutions t...

متن کامل

Reachability Analysis Applied to Space Situational Awareness

Several existing and emerging applications of Space Situational Awareness (SSA) relate directly to spacecraft Rendezvous, Proximity Operations, and Docking (RPOD) and Formation / Cluster Flight (FCF). Observation correlation of nearby objects, control authority estimation, sensor-track re-acquisition, formation re-configuration feasibility, ‘stuck’ thrusters, and worst-case passive safety analy...

متن کامل

Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption

We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reachability sets. This approach leads to a characterization via a Hamilton-Jacobi equation, without assuming any controllability assumption. We also treat the case of time-dependent state constraints, as well as a target ...

متن کامل

ComputationalTechniques forReachabilityAnalysis

This work discusses a computational approach to reachability analysis of Max-Plus-Linear (MPL) systems, a class of discreteevent systems widely used in synchronization and scheduling applications. Given a set of initial states, we characterize and compute its “reach tube,” namely the collection of set of reachable states (regarded step-wise as “reach sets”). By an alternative characterization o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015