Skip to main content
SpringerLink
Log in

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

  • Conference paper
Hybrid Systems: Computation and Control (HSCC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4981))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clarke, J.E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge, MA, USA (1999)

    Google Scholar 

  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. 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. Jha, S.K.: Design of a distributed reachability algorithm for analysis of linear hybrid automata. CoRR, abs/0710.3764 (2007)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213,  

    Sumit Kumar Jha

Authors
  1. Sumit Kumar Jha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Magnus Egerstedt Bud Mishra

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jha, S.K. (2008). d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata. In: Egerstedt, M., Mishra, B. (eds) Hybrid Systems: Computation and Control. HSCC 2008. Lecture Notes in Computer Science, vol 4981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78929-1_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78929-1_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78928-4

  • Online ISBN: 978-3-540-78929-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation