Skip to main content

Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method

  • Conference paper
Reachability Problems (RP 2011)

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

Included in the following conference series:

Abstract

Hybrid systems combine continuous and discrete behavior. Hybrid Automata are a powerful formalism for the modeling and verification of such systems. A common problem in hybrid system verification is the good parameters problem, which consists in identifying a set of parameter valuations which guarantee a certain behavior of a system. Recently, a method has been presented for attacking this problem for Timed Automata. In this paper, we show the extension of this methodology for hybrid automata with linear and affine dynamics. The method is demonstrated with a hybrid system benchmark from the literature.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Alur, R., Kanade, A., Ramesh, S., Shashidhar, K.: Symbolic analysis for improving simulation coverage of simulink/stateflow models. In: EMSOFT, pp. 89–98 (2008)

    Google Scholar 

  2. André, É.: IMITATOR: A tool for synthesizing constraints on timing bounds of timed automata. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 336–342. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. André, É.: IMITATOR II: A tool for solving the good parameters problem in timed automata. In: INFINITY. EPTCS, vol. 39, pp. 91–99 (September 2010)

    Google Scholar 

  4. André, É., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. IJFCS 20(5), 819–836 (2009)

    MathSciNet  MATH  Google Scholar 

  5. André, É., Fribourg, L.: Behavioral cartography of timed automata. In: Kučera, A., Potapov, I. (eds.) RP 2010. LNCS, vol. 6227, pp. 76–90. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Bagnara, R., Hill, P., Zaffanella, E.: Applications of polyhedral computations to the analysis and verification of hardware and software systems. Theoretical Computer Science 410(46), 4672–4691 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fehnker, A., Ivancic, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326–341. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Frehse, G.: PHAVer: algorithmic verification of hybrid systems past HyTech. STTT 10(3), 263–279 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Frehse, G., Jha, S., Krogh, B.: A counterexample-guided approach to parameter synthesis for linear hybrid automata. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 187–200. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Fribourg, L., Kühne, U.: Parametric verification of hybrid automata using the inverse method. Research Report LSV-11-04, LSV, ENS Cachan, France (2011)

    Google Scholar 

  11. Henzinger, T., Ho, P.-H., Wong-Toi, H.: HyTech: A model checker for hybrid systems. STTT 1, 110–122 (1997)

    Article  MATH  Google Scholar 

  12. Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? In: JCSS, pp. 373–382 (1995)

    Google Scholar 

  13. Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.: Linear parametric model checking of timed automata. JLAP 52-53, 183–220 (2002)

    MathSciNet  MATH  Google Scholar 

  14. Jha, S., Krogh, B., Weimer, J., Clarke, E.: 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 

  15. Julius, A., Fainekos, G., Anand, M., Lee, I., Pappas, G.: Robust test generation and coverage for hybrid systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 329–342. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Silva, B., Krogh, B.: Modeling and verification of sampled-data hybrid systems. In: ADPM (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fribourg, L., Kühne, U. (2011). Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method. In: Delzanno, G., Potapov, I. (eds) Reachability Problems. RP 2011. Lecture Notes in Computer Science, vol 6945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24288-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24288-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24287-8

  • Online ISBN: 978-3-642-24288-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics