Article

Discretizing affine hybrid automata with uncertainty

Authors:

Thao Dang,

Thomas Martin GawlitzaAuthors Info & Claims

ATVA'11: Proceedings of the 9th international conference on Automated technology for verification and analysis

Pages 473 - 481

Published: 11 October 2011 Publication History

Publisher Site

Abstract

Over-approximating the set of all reachable states of a given system is an important task for the verification of safety properties. Such an unbounded time verification is in particular challenging for hybrid systems. We recently developed an algorithm that over-approximates the set of all reachable states of a given affine hybrid automata by performing linear template-based abstract interpretation [4]. In this article we extend the previous results by adding uncertainty to the model of affine hybrid automata. Uncertainty can be used for abstracting the behavior of non-linear hybrid systems.We adapt our techniques to this model and show that, w.r.t. given linear templates, the abstract reachability problem is still in coNP by reducing abstract reachability for affine hybrid automata with uncertainty to abstract reachability for affine programs (affine hybrid automata where only discrete transitions are allowed). We thus provide a new connection between a continuous time model and a purely discrete model.

References

[1]

Asarin, E., Bournez, O., Dang, T., Maler, O.: Approximate reachability analysis of piecewise linear dynamical systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 20-31. Springer, Heidelberg (2000).

Digital Library

Google Scholar

[2]

Chutinan, A., Krogh, B.: Computational techniques for hybrid system verification. IEEE Trans. on Automatic Control (48), 64-75 (2003).

Google Scholar

[3]

Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977).

Digital Library

Google Scholar

[4]

Dang, T., Gawlitza, T.M.: Template-based unbounded time verification of affine hybrid automata. Technical report, VERIMAG (2011).

Google Scholar

[5]

Frehse, G., Guernic, C.L., 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).

Digital Library

Google Scholar

[6]

Gawlitza, T.M.: Strategieverbesserungsalgorithmen für exakte Programmanalysen, Ph.D. Thesis. Dr. Hut Verlag, München, Munich, Germany (October 2009).

Google Scholar

[7]

Girard, A., Guernic, C.L., Maler, O.: Efficient computation of reachable sets of linear time-invariant systems with inputs. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 257-271. Springer, Heidelberg (2006).

Digital Library

Google Scholar

[8]

Kurzhanskiy, A., Varaiya, P.: Ellipsoidal techniques for reachability analysis of discretetime linear systems. IEEE Trans. Automatic Control (52), 26-38 (2007).

Google Scholar

[9]

Kvasnica, M., Grieder, P., Baotic M., Morari, M.: Multi-parametric toolbox (mpt). In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 448-462. Springer, Heidelberg (2004).

Google Scholar

[10]

Prajna, S., Jadbabaie, A.: Safety verification of hybrid systems using barrier certificates. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 477-492. Springer, Heidelberg (2004).

Google Scholar

[11]

Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25- 41. Springer, Heidelberg (2005).

Digital Library

Google Scholar

[12]

Sankaranarayanan, S., Dang, T., Ivančic, F.: A policy iteration technique for time elapse over template polyhedra. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 654-657. Springer, Heidelberg (2008).

Digital Library

Google Scholar

[13]

Tarski, A.: A lattice-theoretical fixpoint theorem and its appications. Pac. J. Math. 5, 285- 309 (1955).

Google Scholar

[14]

Tiwari, A., Khanna, G.: Nonlinear systems: Approximating reach sets. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 600-614. Springer, Heidelberg (2004).

Google Scholar

Cited By

View all

Huang CChen XLin WYang ZLi X(2017)Probabilistic Safety Verification of Stochastic Hybrid Systems Using Barrier CertificatesACM Transactions on Embedded Computing Systems10.1145/312650816:5s(1-19)Online publication date: 27-Sep-2017
https://dl.acm.org/doi/10.1145/3126508
Schrammel PGirault AGuan N(2015)Unbounded-time reachability analysis of hybrid systems by abstract accelerationProceedings of the 12th International Conference on Embedded Software10.5555/2830865.2830871(51-54)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.5555/2830865.2830871
Schrammel PSubotic P(2013)Logico-Numerical Max-Strategy IterationProceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 773710.1007/978-3-642-35873-9_25(414-433)Online publication date: 20-Jan-2013
https://dl.acm.org/doi/10.1007/978-3-642-35873-9_25
Show More Cited By

Recommendations

Hybrid automata-based CEGAR for rectangular hybrid systems

In this paper, we present a counterexample guided abstraction refinement (CEGAR) framework for systems modelled as rectangular hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we ...
Translation from Multisingular Hybrid Petri Nets to Multisingular Hybrid Automata

In this paper, we investigate some important aspects of a new formalism for modelling and verification of hybrid dynamic systems HDS, which is called multisingular hybrid Petri nets MSHPNs. This new hybrid formalism is aimed to bridge the gap between ...
Hybridization Based CEGAR for Hybrid Automata with Affine Dynamics
Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636

We consider the problem of safety verification for hybrid systems, whose continuous dynamics in each mode is affine, $$\dot{X}=AX+b$$, and invariants and guards are specified using rectangular constraints. We present a counter-example guided abstraction ...

Comments

Information & Contributors

Information

Published In

ATVA'11: Proceedings of the 9th international conference on Automated technology for verification and analysis

October 2011

532 pages

ISBN:9783642243714

Editors:
Tevfik Bultan
University of California, Department of Computer Science, Santa Barbara, CA
,
Pao-Ann Hsiung
National Chung Cheng University, Department of Computer Science and Information Engineering, Chiayi, Taiwan, ROC

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 October 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Huang CChen XLin WYang ZLi X(2017)Probabilistic Safety Verification of Stochastic Hybrid Systems Using Barrier CertificatesACM Transactions on Embedded Computing Systems10.1145/312650816:5s(1-19)Online publication date: 27-Sep-2017
https://dl.acm.org/doi/10.1145/3126508
Schrammel PGirault AGuan N(2015)Unbounded-time reachability analysis of hybrid systems by abstract accelerationProceedings of the 12th International Conference on Embedded Software10.5555/2830865.2830871(51-54)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.5555/2830865.2830871
Schrammel PSubotic P(2013)Logico-Numerical Max-Strategy IterationProceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 773710.1007/978-3-642-35873-9_25(414-433)Online publication date: 20-Jan-2013
https://dl.acm.org/doi/10.1007/978-3-642-35873-9_25
Schrammel PJeannet BDang TMitchell I(2012)From hybrid data-flow languages to hybrid automataProceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control10.1145/2185632.2185658(167-176)Online publication date: 17-Apr-2012
https://dl.acm.org/doi/10.1145/2185632.2185658

Abstract

References

Cited By

Recommendations

Hybrid automata-based CEGAR for rectangular hybrid systems

Translation from Multisingular Hybrid Petri Nets to Multisingular Hybrid Automata

Hybridization Based CEGAR for Hybrid Automata with Affine Dynamics

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations