Symbolic Reachability Analysis of Lazy Linear Hybrid Automata

  • Susmit Jha
  • Bryan A. Brady
  • Sanjit A. Seshia
Conference paper

DOI: 10.1007/978-3-540-75454-1_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4763)
Cite this paper as:
Jha S., Brady B.A., Seshia S.A. (2007) Symbolic Reachability Analysis of Lazy Linear Hybrid Automata. In: Raskin JF., Thiagarajan P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg

Abstract

Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems containing finite-precision sensors and actuators interacting with their environment under bounded inertial delays. In this paper, we present a symbolic technique for reachability analysis of lazy linear hybrid automata. The model permits invariants and guards to be nonlinear predicates but requires flow values to be constants. Assuming finite precision, flows represented by uniform linear predicates can be reduced to those containing values from a finite set of constants. We present an abstraction hierarchy for LLHA. Our verification technique is based on bounded model checking and k-induction for reachability analysis at different levels of the abstraction hierarchy within an abstraction-refinement framework. The counterexamples obtained during BMC are used to construct refinements in each iteration. Our technique is practical and compares favorably with state-of-the-art tools, as demonstrated on examples that include the Air Traffic Alert and Collision Avoidance System (TCAS).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Susmit Jha
    • 1
  • Bryan A. Brady
    • 1
  • Sanjit A. Seshia
    • 1
  1. 1.EECS Department, UC Berkeley 

Personalised recommendations