Christian Schilling:
A Gentle Introduction to Reachability Analysis for Dynamical Systems

  Watch on YouTube

In this presentation, Prof. Schilling will explain the principles of bounded-time reachability methods. These are essentially symbolic-numeric ODE solvers lifted to sets of states and can compute infinitely many trajectories at the same time. With such approaches we can exhaustively analyze systems with uncertainty in the initial condition or in the dynamics (control inputs, disturbances, etc.). An immediate application is to prove that a system cannot reach an error state under any circumstance. The presented approaches are available in the tool JuliaReach.

Slider 1

Prof. Christian Schilling received his doctoral degree in computer science from the University of Freiburg, Germany, in 2018. He was a postdoctoral research fellow at IST Austria and an interim professor for cyber-physical system at the University of Konstanz, Germany. Since 2021 he is an assistant professor in the Distributed, Embedded and Intelligent Systems group at Aalborg University in Denmark. Christian's research in the area of formal methods is focused on the analysis, verification, and synthesis of systems with dynamical or machine-learned components.