Susmit Kumar Jha and Bryan Brady and Sanjit A. Seshia

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2007-32

February 28, 2007

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-32.pdf

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 only linear flow constraints but the invariants and guards can be any computable function. 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).

---

BibTeX citation:

@techreport{Jha:EECS-2007-32,
    Author= {Jha, Susmit Kumar and Brady, Bryan and Seshia, Sanjit A.},
    Title= {Symbolic Reachability Analysis of Lazy Linear Hybrid Automata},
    Year= {2007},
    Month= {Feb},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-32.html},
    Number= {UCB/EECS-2007-32},
    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 only linear flow constraints but the invariants and guards can be any computable function. 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).},
}

EndNote citation:

%0 Report
%A Jha, Susmit Kumar 
%A Brady, Bryan 
%A Seshia, Sanjit A. 
%T Symbolic Reachability Analysis of Lazy Linear Hybrid Automata
%I EECS Department, University of California, Berkeley
%D 2007
%8 February 28
%@ UCB/EECS-2007-32
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-32.html
%F Jha:EECS-2007-32