Verification of Supervisory Control Software Using State Proximity and Merging

  • Authors:
  • Flavio Lerda;James Kapinski;Edmund M. Clarke;Bruce H. Krogh

  • Affiliations:
  • School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213;Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213;Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213

  • Venue:
  • HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes an approach for bounded-time verification of safety properties of supervisory control software interacting with a continuous-time plant. A combination of software Model Checking and numerical simulation is used to compute a conservative approximation of the reachable states. The technique verifies system properties in the presence of nondeterministic behavior in the software due to, for instance, interleaving of tasks. A notion of program equivalenceis used to characterize the behaviors of the controller, and the bisimulation functions of Girard and Pappas are employed to characterize the behaviors of the plant. The approach can conservatively merge traces that reach states that are in proximity to each other. The technique has been implemented for the case of affine plant dynamics, which allows efficient operations on ellipsoidal sets based on convex optimization involving linear matrix inequalities (LMIs). We present an illustrative example for a model of the position controller of an unmanned aerial vehicle (UAV).