Advertisement

d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

  • Sumit Kumar Jha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4981)

Abstract

This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the reachability problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamples. The d-IRA algorithm is resistant to failure of multiple computational nodes. The experimental results provide promising evidence for the possible successful application of this technique.

Keywords

Model Check Computational Node Master Node Slave Node Adaptive Cruise Control 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clarke, J.E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge, MA, USA (1999)Google Scholar
  2. 2.
    Frehse, G.: PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 258–273. Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Ho, P.-H.: Automatic Analysis of Hybrid Systems, Ph.D. thesis, technical report CSD-TR95-1536, Cornell University, pages 188 (August 1995)Google Scholar
  4. 4.
    Jha, S.K.: Design of a distributed reachability algorithm for analysis of linear hybrid automata. CoRR, abs/0710.3764 (2007)Google Scholar
  5. 5.
    Jha, S.K., Krogh, B.H., Weimer, J.E., Clarke, E.M.: Reachability for linear hybrid automata using iterative relaxation abstraction. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 287–300. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Li, X., Jha, S.K., Bu, L.: Towards an Efficient Path-Oriented Tool for Bounded Reachability analysis of Linear Hybrid Systems using Linear Programming. In: BMC (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sumit Kumar Jha
    • 1
  1. 1.Computer Science DepartmentCarnegie Mellon UniversityPittsburgh 

Personalised recommendations