Skip to main content
SpringerLink
Log in

Path-oriented bounded reachability analysis of composed linear hybrid systems

  • Regular Paper
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

The existing techniques for reachability analysis of linear hybrid systems do not scale well to the problem size of practical interest. The performance of existing techniques is even worse for reachability analysis of a composition of several linear hybrid automata. In this paper, we present an efficient path-oriented approach to bounded reachability analysis of composed systems modeled by linear hybrid automata with synchronization events. It is suitable for analyzing systems with many components by selecting critical paths, while this task was quite insurmountable before because of the state explosion problem. This group of paths will be transformed to a group of linear constraints, which can be solved by a linear programming solver efficiently. This approach of symbolic execution of paths allows design engineers to check important paths, and accordingly increase the faith in the correctness of the system. This approach is implemented into a prototype tool Bounded reAchability CHecker (BACH). The experimental data show that both the path length and the number of participant automata in a system checked using BACH can scale up greatly to satisfy practical requirements.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Henzinger, T.: The theory of hybrid automata. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278–292 (1996)

  2. Kesten, Y., Pnueli, A., Sifakis, J., Yovine, S.: Integration graphs: a class of decidable hybrid systems. In: Hybrid System. LNCS, vol. 736, pp. 179–208

  3. Alur R., Courcoubetis C., Halbwachs N., Henzinger T.A., Ho P.-H., Nicollin X., Olivero A., Sifakis J., Yovine S.: The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138, 3–34 (1995)

    Article  MATH  Google Scholar 

  4. Henzinger T., Kopke P., Puri A., Varaiya P.: What’s decidable about hybrid automata?. J. Comput. Syst. Sci. 57, 94–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Henzinger, T., Ho, P.-H., Wong-Toi, H.: HYTECH: a model checker for hybrid systems. In: Software Tools for Technology Transfer, vol. 1, pp. 110–122 (1997)

  6. Frehse, G.: PHAVer: algorithmic verification of hybrid systems past HyTech. In: Proceeding of Hybrid Systems: Computation and Control’05. LNCS, vol. 2289, pp. 258–273 (2005)

  7. Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded model checking. In: Advance in Computers, vol. 58. Academic Press, London (2003)

  8. Zhang, L., Malik, S.: The quest for efficient boolean satifiability solvers. In: Proceedings of CAV 2002. LNCS, vol. 2404, pp. 17–36. Springer, Berin (2002)

  9. Fränzle M., Herde C., Ratschan S., Schubert T., Teige T.: Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. J. Satisf. Boolean Model. Comput. 1, 209–236 (2007)

    Google Scholar 

  10. Audemard G., Bozzano M., Cimatti A., Sebastiani R.: Verifying industrial hybrid systems with MathSAT. Electron. Notes Theor. Comput. Sci. 119(2), 17–32 (2005)

    Article  Google Scholar 

  11. Audemard, G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: Bounded model checking for timed systems. In: Conference on Formal Techniques for Networked and Distributed Systems. In: LNCS, vol. 2529, pp. 243–259 (2002)

  12. Ábrahám, E., Becker, B., Klaedtke, F., Steffen, M.: Optimizing bounded model checking for linear hybrid systems. In: Proceedings of VMCAI 2005. LNCS, vol. 3385, pp. 396–412

  13. Li, X., Jha, S., Bu, L.: Towards an efficient path-oriented tool for bounded reachability analysis of linear hybrid systems using linear programming. In: ENTCS, vol. 174, issue 3, pp. 57–70 (2007)

  14. Bu, L., Li, Y., Wang, L., Li, X.: BACH: Bounded ReachAbility CHecker for linear hybrid automata. In: Proceedings of the 8th International Conference on Formal Methods in Computer Aided Design, pp. 65–68. IEEE Computer Society Press, Portland, OR, USA (2008)

  15. Bu, L., Li, Y., Wang, L., Chen, X., Li, X.: BACH 2: Bounded ReachAbility CHecker for compositional linear hybrid systems. In: Proceedings of the 13th Design Automation and Test in Europe Conference, Dresden, Germany, pp. 1512–1517 (2010)

  16. Alur, R.: Timed automata. In: Proceedings of the 11th International Conference on Computer-Aided Verification. In: LNCS, vol. 1633, pp. 8–22. Springer, Berlin (1999)

  17. Wang F.: Symbolic parametric safety analysis of linear hybrid systems with bdd-like data structures. IEEE Trans. Softw. Eng. 31(1), 38–51 (2005)

    Article  Google Scholar 

  18. OR-Objects of DRA Systems. http://OpsResearch.com/OR-Objects/index.html

  19. Malinowski, J., Niebert, P.: SAT based bounded model checking with partial order semantics for timed automata. In: Proceedings of TACAS 2010, Paphos, Cyprus. LNCS, vol. 6015, pp. 405–419 (2010)

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, Jiangsu, 210093, People’s Republic of China

    Lei Bu & Xuandong Li

  2. Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, 210093, People’s Republic of China

    Lei Bu & Xuandong Li

Authors
  1. Lei Bu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xuandong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuandong Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bu, L., Li, X. Path-oriented bounded reachability analysis of composed linear hybrid systems. Int J Softw Tools Technol Transfer 13, 307–317 (2011). https://doi.org/10.1007/s10009-010-0163-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-010-0163-9

Keywords

Search

Navigation