Skip to main content

Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis

  • Conference paper
Reachability Problems (RP 2012)

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

Included in the following conference series:

Abstract

When designing embedded systems, often the need arises to model systems having a mixed discrete and continuous behavior. Such hybrid systems commonly consist of a discrete control part that operates in a continuous environment and may be represented by hybrid automata. We recently proposed an open-source framework for hybrid automata analysis, called Ariadne, which exploits approximation techniques based on the theory of computable analysis. In this paper we will show how the approximation capabilities of Ariadne can be used to verify nonlinear hybrid automata inside a design space by means of reachability analysis. In particular, we will use the tool to solve a problem of dominance checking.

This research was partly supported by the EU projects FP7-ICT-217069 COCONUT and FP7-ICT-223844 CON4COORD.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 3–34 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ariadne: An open tool for hybrid system analysis, http://ariadne.parades.rm.cnr.it

  3. Bauer, S.S., Fahrenberg, U., Juhl, L., Larsen, K.G., Legay, A., Thrane, C.: Quantitative Refinement for Weighted Modal Transition Systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 60–71. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Benvenuti, L., Bresolin, D., Casagrande, A., Collins, P., Ferrari, A., Mazzi, E., Sangiovanni-Vincentelli, A., Villa, T.: Reachability computation for hybrid systems with Ariadne. In: Proc. of the 17th IFAC World Congress (2008)

    Google Scholar 

  5. Benvenuti, L., Ferrari, A., Mangeruca, L., Mazzi, E., Passerone, R., Sofronis, C.: A contract-based formalism for the specification of heterogeneous systems. In: Proc. of FDL 2008, pp. 142–147 (September 2008)

    Google Scholar 

  6. Benvenuti, L., Ferrari, A., Mazzi, E., Sangiovanni Vincentelli, A.L.: Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 58–71. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Chatterjee, K., de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Compositional quantitative reasoning. In: Proc. of QUEST 2006, pp. 179–188. IEEE Computer Society (September 2006)

    Google Scholar 

  8. Clarke, E., Fehnker, A., Han, Z., Krogh, B., Ouaknine, J., Stursberg, O., Theobald, M.: Abstraction and counterexample-guided refinement in model checking of hybrid systems. Internat. J. Found. Comput. Sci. 14(4), 583–604 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Collins, P.: Semantics and computability of the evolution of hybrid systems. SIAM J. Control Optim. 49, 890–925 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Collins, P., Bresolin, D., Geretti, L., Villa, T.: Computing the evolution of hybrid systems using rigorous function calculus. In: Proc. of ADHS 2012, pp. 284–290. Elsevier (2012)

    Google Scholar 

  11. Frehse, G.: Phaver: algorithmic verification of hybrid systems past hytech. Int. J. on Software Tools for Technology Transfer 10, 263–279 (2008)

    Article  MathSciNet  Google Scholar 

  12. Frehse, G., Le Guernic, C., Donzé, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., Maler, O.: SpaceEx: Scalable Verification of Hybrid Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379–395. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Henzinger, T.A., Ho, P.H., Wong-Toi, H.: HYTECH: a model checker for hybrid systems. Int. J. on Software Tools for Technology Transfer 1(1-2), 110–122 (1997)

    Article  MATH  Google Scholar 

  14. Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata. Information and Computation 185(1), 105–157 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Platzer, A., Quesel, J.-D.: KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 171–178. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation based abstraction refinement. ACM Transactions in Embedded Computing Systems 6(1) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benvenuti, L., Bresolin, D., Collins, P., Ferrari, A., Geretti, L., Villa, T. (2012). Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis. In: Finkel, A., Leroux, J., Potapov, I. (eds) Reachability Problems. RP 2012. Lecture Notes in Computer Science, vol 7550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33512-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33512-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33511-2

  • Online ISBN: 978-3-642-33512-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics