Differential Dynamic Logic for Hybrid Systems

By André Platzer. Journal of automated reasoning, 2008

449 citations recorded by the source corpus.

Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equations. With the goal of developing a theoretical and practical foundation for deductive verification of hybrid systems, we introduce a dynamic logic for hybrid programs, which is a program notation for hybrid systems. As a verification technique that is suitable for automation, we introduce a free variable proof calculus with a novel combination of real-valued free variables and Skolemisation for lifting quantifier elimination for real arithmetic to dynamic logic. The calculus is compositional, i.e., it reduces properties of hybrid programs to properties of their parts. Our main result proves that this calculus axiomatises the transition behaviour of hybrid systems completely relative to differential equations. In a case study with cooperating traffic agents of the European Train Control System, we further show that our calculus is well-suited for verifying realistic hybrid systems with parametric system dynamics.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/5ceefe2ee075bdc4d48f81fef091e1ac6bf9af94

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Rajeev Alur
  2. Jan-David Quesel
  3. Stefan Mitsch
  4. Sarah M. Loos
  5. Yanni Kouskoulas
  6. Jean-Baptiste Jeannin
  7. Erik Zawadzki
  8. Aurora C. Schmidt

In Computational Theory and Mathematics

  1. Rajeev Alur
  2. Jan-David Quesel
  3. Yanni Kouskoulas
  4. Jean-Baptiste Jeannin
  5. Erik Zawadzki
  6. Aurora C. Schmidt
  7. Khalil Ghorbal
  8. Ryan Gardner

Citations in the corpus