Science China Information Sciences

, Volume 55, Issue 12, pp 2663–2674 | Cite as

Loop reduction techniques for reachability analysis of linear hybrid automata

Research Paper Progress of Projects Supported by NSFC
First Online:
Received:
Accepted:

Abstract

The problem of reachability analysis of linear hybrid automata (LHA) is very difficult. This paper considers to improve the efficiency of the reachability analysis by optimizing the structures of LHA. We identify two types of loops called the flexible loops and the zero loops, and present the techniques to replace the repetitions of those loops in the behavior of LHA with finite sequences of locations and in the meantime simplify the associated constraints. The techniques work not only for the polyhedral computing based algorithms but also for the bounded model checkers.

Keywords

real-time and hybrid systems linear hybrid automata reachability analysis 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Henzinger T A. The theory of hybrid automata. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, 1996. 278–292Google Scholar
  2. 2.
    Asarin E, Maler O, Pnueli A. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theor Comput Sci, 1995, 138: 35–65MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Alur R, Courcoubetis C, Halbwachs N, et al. The algorithmic analysis of hybrid systems. Theor Comput Sci, 1995, 138: 3–34MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Alur R, Henzinger T A, Ho P H. Automatic symbolic verification of embedded systems. IEEE Trans Softw Eng, 1996, 22: 181–201CrossRefGoogle Scholar
  5. 5.
    Silva B I, Richeson K, Krogh B, et al. Modeling and verification of hybrid dynamical system using checkmate. In: Proceedings of the 4th International Conference on Automation of Mixed Processes: Hybrid Dynamic Systems. Dortmund, 2000. 323–328Google Scholar
  6. 6.
    Asarin E, Dang T, Maler O. The d/dt tool for verification of hybrid systems. In: Brinksma E, Larsen K, eds. Computer Aided Verification. Lecture Notes in Computer Science, Vol 2404. Berlin: Springer, 2002. 746–770Google Scholar
  7. 7.
    Henzinger T A, Ho P H, Wong-Toi H. HyTech: A model checker for hybrid systems. Int J Softw Tools Technol Transf, 1997, 1: 110–122MATHCrossRefGoogle Scholar
  8. 8.
    Frehse G. Phaver: algorithmic verification of hybrid systems past HyTech. Int J Softw Tools Technol Transf, 2008, 10: 263–279MathSciNetCrossRefGoogle Scholar
  9. 9.
    Asarin E, Dang T, Frehse G, et al. Recent progress in continuous and hybrid reachability analysis. In: IEEE International Symposium on Computer Aided Control System Design. Washington, DC: IEEE, 2006. 1582–1587Google Scholar
  10. 10.
    Fränzle M, Herde C. HySat: An efficient proof engine for bounded model checking of hybrid systems. Form Methods Syst Des, 2007, 30: 179–198MATHCrossRefGoogle Scholar
  11. 11.
    Audemard G, Bozzano M, Cimatti A, et al. Verifying industrial hybrid systems with MathSAT. Electron Notes Theor Comput Sci, 2005, 119: 17–32CrossRefGoogle Scholar
  12. 12.
    Bu L, Li Y, Wang L, et al. BACH: Bounded reachability checker for linear hybrid automata. In: 8th International Conference on Formal Methods in Computer Aided Design, Portland, 2008. 65–68Google Scholar
  13. 13.
    Bu L, Li X. Path-oriented bounded reachability analysis of composed linear hybrid systems. Int J Softw Tools Technol Transf, 2011, 13: 307–317CrossRefGoogle Scholar
  14. 14.
    Henzinger T A, Ho P H, and Wong-Toi H. HyTech: the next generation. In: 16th IEEE Real-Time Systems Symposium. Washington, DC: IEEE, 1995. 56–65CrossRefGoogle Scholar
  15. 15.
    Henzinger T A, Horowitz B, Majumdar R, et al. Beyond HyTech: Hybrid systems analysis using interval numerical methods. In: Lynch N, Krogh B, eds. Hybrid Systems: Computation and Control. Lecture Notes in Computer Science, Vol 1790. Berlin: Springer, 2000, 130–144CrossRefGoogle Scholar
  16. 16.
    Bagnara R, Ricci E, Zaffanella E, et al. Possibly not closed convex polyhedra and the parma polyhedra library. In: Hermenegildo M and Puebla G, eds. Static Analysis. Lecture Notes in Computer Science, Vol 2477. Berlin: Springer, 2002, 213–229CrossRefGoogle Scholar
  17. 17.
    Stursberg O, Krogh H. Efficient representation and computation of reachable sets for hybrid systems. In: Maler O, Pnueli A, eds. Hybrid Systems: Computation and Control. Lecture Notes in Computer Science, Vol 2623. Berlin: Springer, 2003. 482–497CrossRefGoogle Scholar
  18. 18.
    Halbwachs N, Proy Y, Raymond P. Verification of linear hybrid systems by means of convex approximations. In: Le Charlier B, ed. Static Analysis. Lecture Notes in Computer Science, Vol 864. Berlin: Springer, 1994. 223–237CrossRefGoogle Scholar
  19. 19.
    Henzinger T A, Ho P H. A note on abstract interpretation strategies for hybrid automata. In: Antsaklis P, Kohn W, Nerode A, eds. Hybrid Systems II. Lecture Notes in Computer Science, Vol 999. Berlin: Springer, 1995. 252–264CrossRefGoogle Scholar
  20. 20.
    Asarin E, Dang T, Maler O, et al. Approximate reachability analysis of piecewise-linear dynamical systems. In: Lynch N, Krogh B, eds. Hybrid Systems: Computation and Control. Lecture Notes in Computer Science, Vol 1790. Berlin: Springer, 2000. 20–31CrossRefGoogle Scholar
  21. 21.
    Chinneck J W, Dravnieks E W. Locating minimal infeasible constraint sets in linear programs. ORSA J Comput, 1991, 3: 157–168MATHCrossRefGoogle Scholar
  22. 22.
    Kesten Y, Pnueli A, Sifakis J, et al. Decidable integration graphs. Inf Comput, 1999, 150: 209–243MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    Alur R, Courcoubetis C, Henzinger T A. Computing accumulated delays in real-time systems. Form Methods Syst Des, 1997, 11: 137–155CrossRefGoogle Scholar
  24. 24.
    Henzinger T A, Kopke P W, Puri A, et al. What’s decidable about hybrid automata? J Comput Syst Sci, 1998, 57: 94–124MathSciNetMATHCrossRefGoogle Scholar
  25. 25.
    Li X, Zhao J, Yu P, et al. Positive loop-closed automata: a decidable class of hybrid systems. J Logic Algebr Program, 2002: 79–108Google Scholar
  26. 26.
    Damm W, Ihlemann C, Sofronie-Stokkermans V. Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata. In: Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control. New York: ACM, 2011. 73–82Google Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.State Key Laboratory for Novel Software Technology, Department of Computer Science and TechnologyNanjing UniversityNanjingChina

Personalised recommendations